On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm

Algorithmica (New York)

Volumn 16, Issue 2, 1996, Pages 233-242

  Mehlhorn, K ^b   Mutzel, P ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b NONE

Author keywords

Combinatorial embedding; Planar embedding; Planarity testing; Topological embedding

Indexed keywords

EID: 0005316925     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01940648     Document Type: Article

References (14)

1. K. Booth and L. Lueker. Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms. J. Comput. System Sci., 13:335-379, 1976.
2. N. Chiba, T. Nishizeki, S. Abe, and T. Ozawa. A linear algorithm for embedding planar graphs using PQ-trees. J. Comput. System Sci., 30(1):54-76, 1985.
3. S. Even and R. E. Tarjan. Computing an st-numbering. Theoret. Comput. Sci., 2:339-344, 1976.
4. H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10:41-51, 1991.
5. H. de Fraysseix and P. Rosenstiehl. A depth-first-search characterization of planarity. Ann. Discrete Math., 13:75-80, 1982.
6. J. Hopcroft and R. Tarjan. Efficient planarity testing. J. Assoc. Comput. Mach., 21(4):549-568, 1974.
7. A. Lempel, S. Even, and I. Cederbaum. An algorithm for planarity testing of graphs: Theory of Graphs. Internat. Symp. (Rome, 1966), pages 215-232, 1967.
8. K. Mehlhorn. Data Structures and Efficient Algorithms. Volumes I, II, III. Springer-Verlag, Berlin, 1984.
9. K. Mehlhorn, P. Mutzel, and St. Näher. An implementation of the Hopcroft and Tarjan planarity test and embedding algorithm. Technical Report MPI-I-93-151, Max-Planck-Institut für Informatik, Saarbrücken, 1993.
10. K. Mehlhorn and St. Näher. LEDA: A library of efficient data types and algorithms. Comm. ACM, 38(1):96-102, 1995.
11. P. Mutzel. A fast linear time embedding algorithm based on the Hopcroft-Tarjan planarity test. Technical Report, Universität zu Köln, 1992.
12. St. Näher. LEDA manual version 3.1. Technical Report MPI-I-95-1-002, Max-Planck-Institut für Informatik, Saarbrücken, 1995.
13. W. Schnyder. Embedding planar graphs on the grid. In Proc. Ist ACM-SIAM Symp. on Discrete Algebra (SODA), San Francisco, pages 138-148, 1990.
14. S. G. Williamson. Depth-first search and Kuratowksi subgraphs. J. Assoc. Comput. Mach., 11:681-693, 1984.