Advances in c-planarity testing of clustered graphs

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

Volumn 2528 LNCS, Issue , 2002, Pages 220-236

  Gutwenger, Carsten ^b   Jünger, Michael ^a   Leipert, Sebastian ^b   Mutzel, Petra ^c   Percan, Merijam ^a   Weiskircher, René ^c  

^a UNIVERSITY OF COLOGNE   (Germany)

^b CENTER OF ADVANCED EUROPEAN STUDIES AND RESEARCH CAESAR   (Germany)

^c VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); POLYNOMIAL APPROXIMATION; ALGORITHMS; GRAPHIC METHODS; TREES (MATHEMATICS);

C-PLANARITY TESTING; CLUSTERED GRAPH; CONNECTED GRAPH; CONNECTIVITY AUGMENTATION PROBLEMS; INDUCED SUBGRAPHS; NATURAL EXTENSION; POLYNOMIAL-TIME ALGORITHMS; UNDIRECTED GRAPH;

TREES (MATHEMATICS); GRAPH THEORY;

EID: 84867464125     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36151-0_21     Document Type: Conference Paper

References (9)

1. G. Di Battista, W. Didimo, and A. Marcandalli. Planarization of clustered graphs (extended abstract). In P. Mutzel, Michael Jünger, and Sebastian Leipert, editors, Graph Drawing, volume 2265 of Lecture Notes in Computer Science, pages 60-74. Springer-Verlag, 2002.
2. K. Booth and G. Lueker. Testing for the consecutive ones property, interval graphs, and graph planarity using pq-tree algorithms. Journal of Computer and System Sciences, 13(1):335-379, 1976.
3. G. Di Battista and R. Tamassia. On-line planarity testing. SIAM Journal on Computing, 25(5):956-997, 1996.
4. I. Cederbaum, S. Even, and A. Lempel. An algorithm for planarity testing of graphs. In Theory of Graphs, International Symposium, Rome, pages 215-232, 1967.
5. E. Dahlhaus. Linear time algorithm to recognize clustered planar graphs and its parallelization (extended abstract). In C. L. Lucchesi, editor, LATIN '98, 3rd Latin American symposium on theoretical informatics, Campinas, Brazil, April 20-24, 1998., volume 1380 of Lecture Notes in Computer Science, pages 239-248, 1998.
6. P. Eades, Q.-W. Feng, and H. Nagamochi. Drawing clustered graphs on an orthogonal grid. Journal of Graph Algorithms and Applications, 3:3-29, 2000.
7. Q.-W. Feng, R.-F. Cohen, and P. Eades. Planarity for clustered graphs. In P. Spirakis, editor, Algorithms - ESA '95, Third Annual European Symposium, volume 979 of Lecture Notes in Computer Science, pages 213-226. Springer-Verlag, 1995.
8. C. Gutwenger, M. Jünger, S. Leipert, P. Mutzel, M. Percan, and R. Weiskircher. Subgraph induced planar connectivity augmentation. Technical report, Institut für Informatik, Universität zu Köln, 2002. zaik2002-435.
9. C. Gutwenger and P. Mutzel. A linear time implementation of SPQR-trees. In J. Marks, editor, Graph Drawing (Proc. 2000), volume 1984 of Lecture Notes in Computer Science, pages 77-90. Springer-Verlag, 2001.