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

473 Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms – K Booth, G Lueker - 1976
230 Efficient planarity testing – J E Hopcroft, R E Tarjan - 1974
16 A characterization of planar graphs by Trémaux orders – H de Fraysseix, P Rosenstiehl - 1985
14 Stop minding your P’s and Q’s: implementing fast and simple DFS-based planarity and embedding algorithm – J M Boyer, P F Cortese, M Patrignani, G Di Battista - 2004
63 Computing an st-numbering – S Even, R E Tarjan - 1976
116 A linear algorithm for embedding planar graphs using PQ-trees,"JCSS 30 – N Chiba, T Nishizeki, S Abe, T Ozawa - 1985
996 Depth first search and linear graph algorithms – Robert Tarjan - 1972
166 Sur le problème des courbes gauches en topologie – K Kuratowski - 1930
108 An algorithm for planarity testing of graphs – A Lempel, S Even, I Cederbaum - 1966
19 A New Planarity Test – Wei-kuan Shih, Wen-Lian Hsu - 1999
33 Planarizing Graphs -- A Survey and Annotated Bibliography – Annegret Liebers - 1999
35 On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm – Kurt Mehlhorn, Petra Mutzel - 1994
8 Note on Hopcroft and Tarjan planarity algorithm – N Deo - 1976
246 Algorithmic Graph Theory – Alan Gibbons - 1985
333 Graph Drawing: Algorithms for the visualization of graphs – G Di Battista, P Eades, R Tamassia, I G Tollis - 1999
10 Pitfalls of using PQ-Trees in Automatic Graph Drawing – Michael Jünger, Sebastian Leipert, Petra Mutzel - 1997
3 An efficient implementation of the PC-trees algorithm of shih and hsu’s planarity test – Wen-lian Hsu - 2003
4 Additional PC-tree planarity conditions – J M Boyer - 2004
28 On the cutting edge: Simplified O(n) planarity by edge addition – John M. Boyer, Wendy J. Myrvold - 2004