Extracting a Maximum Planar VLSI Part
Part of the Mathematics and Its Applications book series (MAIA, volume 399)
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
of the original hypergraph model to a planar hypergraph. This transformation is performed by splitting hyperedges, i.e. a hyperedge H ∈ H of the set H′ is associated with the disjoint hyperedges whose union coincides with H.
$$G = (V,H) \to G' = (V,H')$$
Unable to display preview. Download preview PDF.
© Springer Science+Business Media Dordrecht 1997