On the Planarity of Hypergraphs.

On the Planarity of Hypergraphs.

Active / Technical Report | Accession Number: ADA048051 |

Abstract:

Two definitions for the planarity of a hypergraph will be given. These definitions are related to the problem of modelling circuits for circuit layout. It is shown that if a hypergraph is planar according to the first definition, then it is planar according to the second definition, but the reverse does not hold. Testing the planarity can be done in linear time by using the first definition but requires an enumeration using the second definition. The more accurate model for the circuit layout problem uses the second definition. Author

Author(s):

Vancleemput, W. M.

Author Organization(s):

STANFORD UNIV CALIF DIGITAL SYSTEMS LAB

Descriptive Note:

Technical note,

Pagination:

0009

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:

Approved For Public Release

RECORD

Collection: TR

Identifying Numbers

Report Number(s):

DSL-TN-115

Contract/Grant Number(s):

N00014-75-C-0601

Subject Terms

Joint Capability Areas:

JCA_5_Command and Control; JCA_3.2_Engagement; JCA_3_Force Application; JCA_5.2_Understand; JCA_1_Force Support; JCA_1.2_Force Preparation; JCA_3.2.1_Kinetic Means; JCA_1.2.3_Educating; JCA_6.4.1_Secure Information Exchange; JCA_4.6_Engineering; JCA_6_Net Centric; JCA_6.4_Information Assurance

Communities of Interest:

Weapons Technologies

Descriptor(s):

*MATHEMATICAL MODELS, *GRAPHS, *CIRCUIT ANALYSIS, PLANAR STRUCTURES, MAPPING(TRANSFORMATIONS)

Field(s)/Group(s):

Numerical Mathematics

Keyword(s):

*Graph theory, Hypergraphics

Report Date:

1977 Jun 01