C-planarity of extrovert clustered graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3843 LNCS, Issue , 2006, Pages 211-222

  Goodrich, Michael T ^a   Lueker, George S ^a   Sun, Jonathan Z ^a  

^a Irvine   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; NUMERICAL ANALYSIS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; TREES (MATHEMATICS);

CLUSTERED GRAPH; CROSSINGS; GRAPH ISOMORPHISM; TREE STRUCTURE;

GRAPH THEORY;

EID: 33745675954     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11618058_20     Document Type: Conference Paper

References (17)

1. G. D. Battista, W. Didimo, and A. Marcandalli. Planarization of clustered graphs. In Graph Drawing (GD'01), LNCS 2265, pages 60-74, 2001.
2. G. D. Battista and R. Tamassia. On-line planarity testing. SIAM J. Comput., 25(5):956-997, 1996.
3. K. Booth and G. Lueker. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Systems Sci., 13(3):335-379, 1976.
4. P. G. Cortese, G. D. Battista, M. Patrignani, and M. Pizzonia. Clustering cycles into cycles of clusters. In Graph Drawing (GD'04), 2004.
5. E. Dahlhaus. A linear time algorithm to recognize clustered planar graphs and its parallelization. In LATIN'98, LNCS 1380, pages 239-248, 1998.
6. C. A. Duncan, M. T. Goodrich, and S. G. Kobourov. Planarity-preserving clustering and embedding for large planar graphs. In Graph Drawing (GD'99), LNCS 1731, pages 186-196, 1999.
7. P. Eades, Q. Feng, and H. Nagamochi. Drawing clustered graphs on an orthogonal grid. Journal of Graph Algorithms and Applications, 3(4):3-29, 1999.
8. P. Beides and Q.-W. Feng. Multilevel visualization of clustered graphs. In Graph Drawing, GD'96, LNCS 1190, pages 101-112, 1996.
9. P. Eades, Q.-W. Feng, and X. Lin. Straight-line drawing algorithms for hierarchical graphs and clustered graphs. In Graph Drawing, GD'96, LNCS 1190, pages 113-128, 1996.
10. P. Eades and M. L. Huang. Navigating clustered graphs using force-directed methods. J. Graph Algorithms and Applications: Special Issue on Selected Papers from 1998 Symp. Graph Drawing, 4(3):157-181, 2000.
11. S. Even and R. E. Tarjan. Computing an st-numbering. Theoretical Computer Science, 2(3):339-344, 1976.
12. Q.-W. Feng, P. Eades, and R. F. Cohen. Clustered graphs and C-planarity. In 3rd Annual European Symposium on Algorithms (ESA '95), LNCS 979, pages 213-226, 1995.
13. C. Gutwenger, M. Jnger, S. Leipert, P. Mutzel, M. Percan, and R. Weiskircher. Advances in C-planarity testing of clustered graphs. In Graph Drawing (GD'02), LNCS 2528, pages 220-235, 2002.
14. J. Hopcroft and R. E. Tarjan. Efficient planarity testing. J. ACM, 21(4):549-568, 1974.
15. W. Hsu and R.M.McConnell. PC trees and circular-ones arrangements. Theoretical Computer Science, 296(1):59-74, 2003.
16. A. Lempel, S. Even, and I. Cederbaum. An algorithm for planarity testing of graphs. In Theory of graphs: International symposium, pages 215-232, 1966.
17. T. Nishizeki and N. Chiba. Planar Graphs: Theory and Algorithms, volume 32 of Ann. Discrete Math. North-Holland, Amsterdam, The Netherlands, 1988.