|
|
Planarity Testing and Embedding
– Pier Francesco Cortese, Maurizio Patrignani
- 2004
|
|
1
|
Planarity Algorithms via PQ-Trees
– Bernhard Haeupler, Robert E. Tarjan
- 2008
|
|
|
Simplified O(n) Planarity Algorithms
– John M. Boyer, Wendy Myrvold
- 2001
|
|
|
Stop Minding Your P's and Q's: Simplified Planarity by Edge Addition
– John M. Boyer, Wendy Myrvold
- 2003
|
|
17
|
On the cutting edge: Simplified O(n) planarity by edge addition
– John M. Boyer, Wendy J. Myrvold
- 2004
|
|
|
PQ-trees and maximal planarization - An approach to skewness
– Gørril Vollen
- 1998
|
|
24
|
Algorithms for Drawing Clustered Graphs
– Qingwen Feng
- 1997
|
|
10
|
Pitfalls of using PQ-Trees in Automatic Graph Drawing
– Michael Jünger, Sebastian Leipert, Petra Mutzel
- 1997
|
|
2
|
A Simple Linear Time Algorithm for Embedding Maximal Planar Graphs
– Hermann Stamm-wilbrandt
- 1993
|
|
5
|
Clustered Graphs and C-planarity
– Qing-wen Feng, Peter Eades, Robert F. Cohen
- 1995
|
|
|
Correcting and Implementing the PC-tree Planarity Algorithm
– John M. Boyer, Cristina G. Fernandes , Alexandre Noma, Jose Coelho de Pina Jr.
|
|
3
|
I/O-Efficient Planar Separators and Applications
– Norbert Zeh
- 2001
|
|
28
|
On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm
– Kurt Mehlhorn, Petra Mutzel
- 1994
|
|
17
|
An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem
– Jiazhen Cai, Xiaofeng Han, Robert E. Tarjan
- 1993
|
|
17
|
Level Planar Embedding in Linear Time
– Michael Jünger, Sebastian Leipert
- 1999
|
|
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
|
|
3
|
Fully Dynamic Planarity Testing with Applications
– Zvi Galil, et al.
|
|
16
|
The Complexity of Planarity Testing
– Eric Allender, Meena Mahajan
- 2000
|
|
4
|
On Computing a Maximal Planar Subgraph using PQ-Trees
– Michael Jünger, Sebastian Leipert, Petra Mutzel
- 1996
|
