DocumentCode
952297
Title
On the planarity of hypergraphs
Author
van Cleemput, W.M.
Author_Institution
Stanford University, Stanford, CA
Volume
66
Issue
4
fYear
1978
fDate
4/1/1978 12:00:00 AM
Firstpage
514
Lastpage
515
Abstract
Two definitions for the planarity of a hypergraph will be given. These definitions are related to the problem of modelling circurs 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.
Keywords
Bipartite graph; Circuit testing; Digital systems; Electronic circuits; Polynomials; Semiconductor device modeling; Tree graphs;
fLanguage
English
Journal_Title
Proceedings of the IEEE
Publisher
ieee
ISSN
0018-9219
Type
jour
DOI
10.1109/PROC.1978.10945
Filename
1455214
Link To Document