On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm (1994)

Cached

Download Links

by Kurt Mehlhorn , Petra Mutzel
Venue:ALGORITHMICA
Citations:34 - 6 self

Documents Related by Co-Citation

112 A linear algorithm for embedding planar graphs using PQ-trees – N Chiba, T Nishizeki, S Abe, T Ozawa - 1985
224 Efficient planarity testing – John Hopcroft, Robert, Tar Jan - 1974
467 Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-trees algorithms – S Booth, G Lueker - 1976
32 Depth-first search and Kuratowski subgraphs – S G Williamson - 1984
170 Dividing a Graph into Triconnected Components – J E Hopcroft, R E Tarjan - 1973
35 A linear time implementation of SPQRtrees – C Gutwenger, P Mutzel - 2001
78 Upward Planarity Testing – Ashim Garg, Roberto Tamassia - 1995
104 Cederbaum I. An algorithm for planarity testing of graphs – A Lempel, S Even - 1967
3 Tarjan [1993], An O(mlogn)-time algorithm for the maximal planar subgraph problem – J Cai, X Han, R E
4 Cederbaum [1967], An algorithm for planarity testing of graphs, Theory of Graphs – A Lempel, S Even, I
4 Lueker [1976], Testing the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms – K S Booth, G S
4 Tarjan [1974], Efficient planarity testing – J E Hopcroft, R E
4 A unified approach to testing, embedding and drawing planar graphs – J Small - 1993
5 A simple linear-time algorithm for embedding maximal planar graphs – H Stamm-Wilbrandt - 1993
32 Graph Algorithms and NP-Completeness – K Mehlhorn - 1984
208 Crossing number is NP-complete – Garey MR, Johnson DS - 1983
76 Planar Graphs: Theory and Algorithms – T Nishizeki, N Chiba - 1988
302 Designing Programs That Check Their Work – Manuel Blum, Sampath Kannan - 1989
635 LEDA: A Platform for Combinatorial and Geometric Computing – Kurt Mehlhorn, Stefan Näher, Christian Uhrig - 1999