论文信息 - Embedding Graphs in the Plane—Algorithmic Aspects

Embedding Graphs in the Plane—Algorithmic Aspects

An exposition of ideas relating to graph planarity, including the construction of planar embeddings when they exist, is given. The notion of the family of “segment graphs” of a graph is discussed. It is shown how to construct a family of spanning forests for the segment graphs of a planar graph G = (V, E) in linear time in |V|.

S. G. Williamson | S. Williamson

[1] Narsingh Deo,et al. Note on Hopcroft and Tarjan's Planarity Algorithm , 1976, J. ACM.

[2] R. Tarjan. Complexity of combinatorial algorithms , 1977 .

[3] C. Kuratowski. Sur le problème des courbes gauches en Topologie , 1930 .

[4] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[5] Frank Rubin. An Improved Algorithm for Testing the Planarity of a Graph , 1975, IEEE Transactions on Computers.

[6] Ronald L. Rivest,et al. The subgraph homeomorphism problem , 1978, STOC.

[7] Robert E. Tarjan,et al. Efficient Planarity Testing , 1974, JACM.

[8] Robert E. Tarjan,et al. Isomorphism of Planar Graphs , 1972, Complexity of Computer Computations.