An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem (1993)

Cached

Download Links

by Jiazhen Cai , Xiaofeng Han , Robert E. Tarjan
Citations:17 - 0 self

Active Bibliography

4 Counting Embeddings of Planar Graphs Using DFS Trees – Jiazhen Cai - 1993
1 Planarity Testing and Embedding – Pier Francesco Cortese, Maurizio Patrignani - 2004
1 Finding the Closed Partition of a Planar Graph – Vijaya Ramachandran, Honghua Yang - 1994
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
10 Pitfalls of using PQ-Trees in Automatic Graph Drawing – Michael Jünger, Sebastian Leipert, Petra Mutzel - 1997
1 Branch-and-Bound Techniques for the Maximum Planar Subgraph Problem – Robert Cimikowski - 1994
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
34 On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm – Kurt Mehlhorn, Petra Mutzel - 1994
Optimal Crossing Minimization . . . – Dietmar Ebner - 2005
Stop Minding Your P's and Q's: Simplified Planarity by Edge Addition – John M. Boyer, Wendy Myrvold - 2003
Simplified O(n) Planarity Algorithms – John M. Boyer, Wendy Myrvold - 2001
1 I/O-Optimal Planar Embedding Using Graph Separators – Norbert Zeh - 2001
1 Planarity Algorithms via PQ-Trees – Bernhard Haeupler, Robert E. Tarjan - 2008
6 Fully Dynamic Planarity Testing with Applications – Zvi Galil, et al.
13 I/O-Efficient Algorithms for Shortest Path Related Problems – Norbert Ralf Zeh - 2002
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