Stop Minding Your P's and Q's: A Simplified O(n) Planar Embedding Algorithm (1999)

by John Boyer , Wendy Myrvold
Venue:In Proc. 10th ACM-SIAM Symposium on Discrete Algorithms, SODA
Citations:24 - 4 self

Documents Related by Co-Citation

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
14 Stop Minding Your P’s and Q’s: Implementing a Fast and Simple DFS-based Planarity Testing and Embedding Algorithm – J. M. Boyer, P. F. Cortese, M. Patrignani, G. Di Battista - 2003
15 A characterization of planar graphs by Trémaux orders – H de Fraysseix, P Rosenstiehl - 1985
62 Computing an st-numbering – S Even, R E Tarjan - 1976
112 A linear algorithm for embedding planar graphs using PQ-trees – N Chiba, T Nishizeki, S Abe, T Ozawa - 1985
104 Cederbaum I. An algorithm for planarity testing of graphs – A Lempel, S Even - 1967
987 Depth first search and linear graph algorithms – Robert Tarjan - 1972
164 le problem des courbes gauches en topologies”, Fund – “Sur Kuratowski - 1930
8 Note on Hopcroft and Tarjan planarity algorithm – N Deo - 1976
4 Additional PC-tree planarity conditions – J Boyer - 2005
18 A New Planarity Test – Wei-kuan Shih, Wen-Lian Hsu - 1999
32 Planarizing Graphs -- A Survey and Annotated Bibliography – Annegret Liebers - 1999
18 Embedding graphs in the plane – algorithmic aspects – S G Williamson
34 On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm – Kurt Mehlhorn, Petra Mutzel - 1994
386 A Separator Theorem for Planar Graphs – Richard J. Lipton, Robert E. Tarjan - 1977
170 Dividing a Graph into Triconnected Components – J E Hopcroft, R E Tarjan - 1973
10 Pitfalls of using PQ-Trees in Automatic Graph Drawing – Michael Jünger, Sebastian Leipert, Petra Mutzel - 1997
246 Algorithmic Graph Theory – A Gibbons - 1985