Pitfalls of using PQ-Trees in Automatic Graph Drawing (1997)

Cached

Download Links

by Michael Jünger , Sebastian Leipert , Petra Mutzel
Citations:10 - 0 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
63 Computing an st-numbering – S Even, R E Tarjan - 1976
8 Note on Hopcroft and Tarjan planarity algorithm – N Deo - 1976
473 Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms – K Booth, G Lueker - 1976
16 A characterization of planar graphs by Trémaux orders – H de Fraysseix, P Rosenstiehl - 1985
25 Stop Minding Your P's and Q's: A Simplified O(n) Planar Embedding Algorithm – John Boyer, Wendy Myrvold - 1999
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
19 A New Planarity Test – Wei-kuan Shih, Wen-Lian Hsu - 1999
108 An algorithm for planarity testing of graphs – A Lempel, S Even, I Cederbaum - 1966
21 Level Planarity Testing in Linear Time – Michael Jünger, Sebastian Leipert, Petra Mutzel - 1999
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
32 Depth-first search and Kuratowski subgraphs – S G Williamson - 1984
19 Embedding graphs in the plane — algorithmic aspects – S G Williamson - 1980
162 Combinatorial Algorithms: Theory and Practice – E M Reingold, J Nievergelt, N Deo - 1977
996 Depth first search and linear graph algorithms – Robert Tarjan - 1972
70 Validating graph drawing aesthetics – H Purchase, Cohen RF, James MI - 1995
24 E#cient planarity testing – J Hopcroft, R E Tarjan - 1974
3 An efficient implementation of the PC-trees algorithm of shih and hsu’s planarity test – Wen-lian Hsu - 2003