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

Active Bibliography

4 A Note on Computing a Maximal Planar Subgraph using PQ-Trees – Michael Jünger, Sebastian Leipert, Petra Mutzel - 1998
1 Angewandte Mathematik und Informatik Universit at zu K oln – Report No, Using Pq-trees, Sebastian Leipert, Michael Junger, Michael Junger, Petra Mutzel, Petra Mutzel - 1998
4 On Computing a Maximal Planar Subgraph using PQ-Trees – Michael Jünger, Sebastian Leipert, Petra Mutzel - 1996
20 Radial Level Planarity Testing and Embedding in Linear Time – Christian Bachmaier, Franz J. Brandenburg, Michael Forster - 2005
4 Track Planarity Testing and Embedding – Christian Bachmaier, Franz J. Brandenburg, Michael Forster - 2004
2 Clustered Level Planarity – Michael Forster, Christian Bachmaier - 2004
21 Level Planarity Testing in Linear Time – Michael Jünger, Sebastian Leipert, Petra Mutzel - 1999
20 Level Planar Embedding in Linear Time – Michael Jünger, Sebastian Leipert - 1999
1 Branch-and-Bound Techniques for the Maximum Planar Subgraph Problem – Robert Cimikowski - 1994
14 Randomized Graph Drawing with Heavy-Duty Preprocessing – David Harel, Meir Sardas - 1994
17 An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem – Jiazhen Cai, Xiaofeng Han, Robert E. Tarjan - 1993
25 Algorithms for Drawing Clustered Graphs – Qingwen Feng - 1997
1 Planarity Testing and Embedding – Pier Francesco Cortese, Maurizio Patrignani - 2004
18 The Thickness of Graphs: A Survey – Petra Mutzel, Thomas Odenthal, Mark Scharbrodt - 1998
3 An Analysis of Heuristics for Graph Planarization – Robert Cimikowski - 1997
5 A linear time algorithm for finding a maximal planar subgraph based on PC-trees – Wen-lian Hsu - 2005
8 Graph Planarization and Skewness – Robert Cimikowski
4 Counting Embeddings of Planar Graphs Using DFS Trees – Jiazhen Cai - 1993
Simplified O(n) Planarity Algorithms – John M. Boyer, Wendy Myrvold - 2001