Correcting and Implementing the PC-tree Planarity Algorithm
by
John M. Boyer
,
Cristina G. Fernandes
,
Alexandre Noma
,
Jose Coelho de Pina Jr.
Active Bibliography
| 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 | |
| 3 | Simpler Projective Plane Embedding – Wendy Myrvold, Jianping Roth - 2000 |
| 17 | On the cutting edge: Simplified O(n) planarity by edge addition – John M. Boyer, Wendy J. Myrvold - 2004 |
| 4 | Elimination of local bridges – Martin Juvan, Bojan Mohar - 1997 |
| Planarity Testing and Embedding – Pier Francesco Cortese, Maurizio Patrignani - 2004 | |
| PQ Trees, PC Trees, and Planar Graphs – Wen-Lian Hsu, Ross M. McConnell - 2001 | |
| 2 | Drawing Database Schemas – Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia |
| 24 | Algorithms for Drawing Clustered Graphs – Qingwen Feng - 1997 |
| 5 | Universal obstructions for embedding extension problems, submitted – Bojan Mohar |
| 4 | Embedding a Graph Into the Torus in Linear Time – Martin Juvan, Joze Marincek, Bojan Mohar - 1994 |
| 1 | Planarity Algorithms via PQ-Trees – Bernhard Haeupler, Robert E. Tarjan - 2008 |
| 1 | A New Parallel Algorithm for Planarity Testing – David Bader, Sukanya Sreshta - 2003 |
| 16 | The Complexity of Planarity Testing – Eric Allender, Meena Mahajan - 2000 |
| 9 | Practical Toroidality Testing – Eugene Neufeld, Wendy Myrvold - 1996 |
| 5 | From Algorithms to Working Programs On the Use of Program Checking in LEDA – Kurt Mehlhorn, Stefan Näher - 1998 |
| 17 | Radial Level Planarity Testing and Embedding in Linear Time – Christian Bachmaier, Franz J. Brandenburg, Michael Forster - 2005 |
| 5 | Clustered Graphs and C-planarity – Qing-wen Feng, Peter Eades, Robert F. Cohen - 1995 |
| 3 | I/O-Efficient Planar Separators and Applications – Norbert Zeh - 2001 |
