On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm (1994)

Cached

Download Links

by Kurt Mehlhorn , Petra Mutzel
Venue:ALGORITHMICA
Citations:34 - 6 self

Active Bibliography

5 Clustered Graphs and C-planarity – Qing-wen Feng, Peter Eades, Robert F. Cohen - 1995
Drawings and Independent Spanning Trees – Kazuyuki Miura - 2001
1 Efficient Algorithms for Drawing Planar Graphs – Md. Saidur Rahman - 1999
25 Algorithms for Drawing Clustered Graphs – Qingwen Feng - 1997
1 Certifying Algorithms (A Paper under Construction) – Kurt Mehlhorn, Arno Eigenwillig, Kanela Kanegossi, Dieter Kratsch, Ross McConnel, Uli Meyer, Jeremy Spinrad - 2005
1 Planarity Algorithms via PQ-Trees – Bernhard Haeupler, Robert E. Tarjan - 2008
8 Elimination of local bridges – Martin Juvan, Bojan Mohar - 1997
11 Output-Sensitive Reporting of Disjoint Paths – Giuseppe Di Battista, Roberto Tamassia, Luca Vismara - 1996
17 An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem – Jiazhen Cai, Xiaofeng Han, Robert E. Tarjan - 1993
3 I/O-Efficient Planar Separators and Applications – Norbert Zeh - 2001
1 Planarity Testing and Embedding – Pier Francesco Cortese, Maurizio Patrignani - 2004
Optimal Crossing Minimization . . . – Dietmar Ebner - 2005
2 Where to Draw the Line – Ashim Garg - 1996
On the Volume and Resolution of 3-Dimensional Convex Graph Drawing (Extended Abstract) – Marek Chrobak, Michael T. Goodrich, Roberto Tamassia
Constrained Planarity • Deletion and Partition Problems • – Maurizio Patrignani, Upward Planarity Outerplanarity
81 Upward Planarity Testing – Ashim Garg, Roberto Tamassia - 1995
4 Embedding a Graph Into the Torus in Linear Time – Martin Juvan, Joze Marincek, Bojan Mohar - 1994
7 Universal obstructions for embedding extension problems – Bojan Mohar
56 A linear time algorithm for embedding graphs in an arbitrary surface – Ken-ichi Kawarabayashi, Bojan Mohar, Bruce Reed, Ken-ichi Kawarabayashi, Ken-ichi Kawarabayashi, Bojan Mohar, Bruce Reed - 1999