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

116 A linear algorithm for embedding planar graphs using PQ-trees,"JCSS 30 – N Chiba, T Nishizeki, S Abe, T Ozawa - 1985
230 Efficient planarity testing – J E Hopcroft, R E Tarjan - 1974
473 Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms – K Booth, G Lueker - 1976
32 Depth-first search and Kuratowski subgraphs – S G Williamson - 1984
178 Dividing a graph into triconnected components – J E Hopcroft, R E Tarjan - 1973
81 Upward Planarity Testing – Ashim Garg, Roberto Tamassia - 1995
39 P.: A linear time implementation of SPQR-trees – C Gutwenger, Mutzel - 1984
108 An algorithm for planarity testing of graphs – A Lempel, S Even, I Cederbaum - 1966
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
212 Crossing number is NP-complete – M R Garey, D S Johnson - 1983
76 Planar graphs: Theory and algorithms – T Nishizeki, N Chiba
307 Designing Programs That Check Their Work – Manuel Blum, Sampath Kannan - 1989
382 HOW TO DRAW A Graph – W. T. Tutte - 1963