Advertisement

Graph Planarization

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

Abstract

A plane graph is a graph drawn on a plane so that no two edges of the graph (or the curves which represent them ) have a common point except a vertex which is incident on them both. Thus the notion of ‘plane graph’ refers to the graph image rather than to the graph itself. A graph is called planar (embeddable in the plane) if it can be drawn on a plane with no two edges crossing each other. The resultant planar graph image is called an embedding of the graph in the plane or a planar embedding. Figure 2.1 shows two planar graphs, only the second of which is plane.

Keywords

Planar Graph Initial Graph Planar Embedding Virtual Edge Biconnected Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

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