Simplified O(n) Planarity Algorithms (2001)

Cached

Download Links

by John M. Boyer , Wendy Myrvold

Active Bibliography

Stop Minding Your P's and Q's: Simplified Planarity by Edge Addition – John M. Boyer, Wendy Myrvold - 2003
Correcting and Implementing the PC-tree Planarity Algorithm – John M. Boyer, Cristina G. Fernandes , Alexandre Noma, Jose Coelho de Pina Jr.
Constrained Planarity • Deletion and Partition Problems • – Maurizio Patrignani, Upward Planarity Outerplanarity
1 Planarity Testing and Embedding – Pier Francesco Cortese, Maurizio Patrignani - 2004
28 On the cutting edge: Simplified O(n) planarity by edge addition – John M. Boyer, Wendy J. Myrvold - 2004
3 Simpler Projective Plane Embedding – Wendy Myrvold, Jianping Roth - 2000
1 Planarity Algorithms via PQ-Trees – Bernhard Haeupler, Robert E. Tarjan - 2008
6 Fully Dynamic Planarity Testing with Applications – Zvi Galil, et al.
Subgraph Homeomorphism via the Edge Addition Planarity Algorithm – John M. Boyer - 2012
A Simpler and Faster Torus Embedding Algorithm – Jennifer Roselynn Woodcock
A Faster Algorithm for Torus Embedding – Jennifer Roselynn Woodcock - 2006
10 Practical Toroidality Testing – Eugene Neufeld, Wendy Myrvold - 1996
8 Elimination of local bridges – Martin Juvan, Bojan Mohar - 1997
23 The Complexity of Planarity Testing – Eric Allender, Meena Mahajan - 2000
PQ Trees, PC Trees, and Planar Graphs – Wen-Lian Hsu, Ross M. McConnell - 2001
unknown title – unknown authors
17 An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem – Jiazhen Cai, Xiaofeng Han, Robert E. Tarjan - 1993
2 Drawing Database Schemas – Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia
25 Algorithms for Drawing Clustered Graphs – Qingwen Feng - 1997