Abstract
A.A. Zykov was the first person to extend the notion of planarity to hyper-graphs [92]. According to [92] a hypergraph is called planar if it has a planar Konig representation. In general, such a definition of a planar hypergraph is not adequate for the planarity of an electrical circuit. In fact, in the layout of a planar circuit the nets correspond to trees which cannot be replaced by star-type subgraphs without creating nonplanarity in all cases. The limitation of using the Zykov hypergraph planarity definition to investigate circuit planarity was shown in [6, 22, 78]. These researches suggested different mathematical models for circuits and introduced corresponding definitions of circuit model planarity which are more suitable for solving the circuit planarization problem. The necessity of solving circuit planarization problems gave rise to a new definition of a planar hypergraph [83] based on the realization concept.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Feinberg, V., Levin, A., Rabinovich, E. (1997). Hypergraph Planarization. In: VLSI Planarization. Mathematics and Its Applications, vol 399. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-5740-7_4
Download citation
DOI: https://doi.org/10.1007/978-94-011-5740-7_4
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-6421-7
Online ISBN: 978-94-011-5740-7
eBook Packages: Springer Book Archive