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

Documents Related by Co-Citation

13 R.: Advances in C-planarity testing of clustered graphs – C Gutwenger, M Jünger, S Leipert, P Mutzel, M Percan, Weiskircher - 2002
59 Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs – Peter Eades, Qingwen Feng, Xuemin Lin, Hiroshi Nagamochi - 1999
15 Drawing Clustered Graphs on an Orthogonal Grid – Peter Eades, Qingwen Feng, Hiroshi Nagamochi - 1999
63 Computing an st-numbering – S Even, R E Tarjan - 1976
60 R.: Algorithms for plane representations of acyclic digraphs – G Di Battista, Tamassia - 1988
35 PC trees and circular-ones arrangements – Wen-lian Hsu, Ross M. Mcconnell
10 Clustering Cycles into Cycles of Clusters – P. F. Cortese, G. Di Battista, M. Patrignani, M. Pizzonia - 2005
14 Linear Time Algorithm to Recognize Clustered Planar Graphs and its Parallelization – Elias Dahlhaus - 1998
230 Efficient planarity testing – J E Hopcroft, R E Tarjan - 1974
473 Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms – K Booth, G Lueker - 1976
81 Multilevel Visualization of Clustered Graphs – Peter Eades, Qingwen Feng - 1997
46 Navigating clustered graphs using force-directed methods – Peter Eades, Mao Lin Huang - 2000
13 Tollis, Constrained visibility representations of graphs – G Di Battista, R Tamassia, I G - 1992
12 Planarization of clustered graphs – G Di Battista, W Didimo, A Marcandalli - 2001
4 Orthogonal Grid Drawing of Clustered Graphs – Peter Eades, Qingwen Feng - 1996
5 Building Interactive Digram Applications – Wei Lai - 1993
25 Algorithms for Drawing Clustered Graphs – Qingwen Feng - 1997
70 Visualization of structural information: Automatic drawing of compound digraphs – K Sugiyama, K Misue - 1991
47 P.: Planarity for clustered graphs – Q W Feng, R F Cohen, Eades - 1995