Extracting a Maximum Planar VLSI Part

  • V. Feinberg
  • A. Levin
  • E. Rabinovich
Part of the Mathematics and Its Applications book series (MAIA, volume 399)

Abstract

In the preceding chapter we demonstrated that a hypergraph is generally a mathematical model of an electrical circuit. If nonplanar connections, i.e. over-the-element routes and those implemented by the connectors, are deleted from a circuit’s implementation then we obtain the transformation
$$G = (V,H) \to G' = (V,H')$$
(5.1)
of the original hypergraph model to a planar hypergraph. This transformation is performed by splitting hyperedges, i.e. a hyperedge HH of the set H′ is associated with the disjoint hyperedges whose union coincides with H.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 1997

Authors and Affiliations

  • V. Feinberg
    • 1
  • A. Levin
    • 2
  • E. Rabinovich
    • 3
  1. 1.SILVACO InternationalSanta ClaraUSA
  2. 2.Intel CorporationSanta ClaraUSA
  3. 3.GorizontMinskBelarus

Personalised recommendations