Clustered Graphs and C-planarity (1995)

Cached

Download Links

by Qing-wen Feng , Peter Eades , Robert F. Cohen
Venue:In 3rd Annual European Symposium on Algorithms (ESA’95), LNCS 979
Citations:5 - 2 self

Active Bibliography

3 Drawing Clustered Graphs on . . . – Peter Eades, Qingwen Feng, Hiroshi Nagamochi - 1999
7 Visualisations of Large Object-Oriented Systems – Philip Haynes, Tim Menzies, Robert F. Cohen - 1995
81 Multilevel Visualization of Clustered Graphs – Peter Eades, Qingwen Feng - 1997
4 Orthogonal Grid Drawing of Clustered Graphs – Peter Eades, Qingwen Feng - 1996
25 Algorithms for Drawing Clustered Graphs – Qingwen Feng - 1997
Drawing Clustered Graphs on an Orthogonal Grid (Extended Abstract) – Peter Eades, Qingwen Feng - 1997
35 On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm – Kurt Mehlhorn, Petra Mutzel - 1994
5 Planar Graphs with Topological Constraints – Christoph Dornheim - 2002
59 Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs – Peter Eades, Qingwen Feng, Xuemin Lin, Hiroshi Nagamochi - 1999
Cluster Planarity Testing for the Case of Not Necessarily Connected Clusters – Robert Beibl
1 Planarity Algorithms via PQ-Trees – Bernhard Haeupler, Robert E. Tarjan - 2008
8 Elimination of local bridges – Martin Juvan, Bojan Mohar - 1997
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
6 Fully Dynamic Planarity Testing with Applications – Zvi Galil, et al.
4 Counting Embeddings of Planar Graphs Using DFS Trees – Jiazhen Cai - 1993
14 Graph Drawing – Roberto Tamassia - 1997
Constrained Planarity • Deletion and Partition Problems • – Maurizio Patrignani, Upward Planarity Outerplanarity