Subgraph induced planar connectivity augmentation: (Extended Abstract)

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

Volumn 2880, Issue , 2003, Pages 261-272

  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

CLUSTERING ALGORITHMS; DRAWING (GRAPHICS); TREES (MATHEMATICS);

C-PLANARITY TESTING; CARDINALITIES; CLUSTERED GRAPH; CONNECTIVITY AUGMENTATION; CONNECTIVITY AUGMENTATION PROBLEMS; EXTENDED ABSTRACTS; GRAPH DRAWING; LINEAR-TIME ALGORITHMS;

GRAPH THEORY;

EID: 0345254980     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39890-5_23     Document Type: Article

References (15)

1. Di Battista, G., Tamassia, R. (1996) On-line planarity testing. Journal on Computing 25 (5), 956-997
2. Cohen, R.-F., Eades, P., Feng, Q.-W. (1995) Planarity for clustered graphs. In P. Spirakis (ed.) Algorithms - ESA '95, Third Annual European Symposium, Lecture Notes in Computer Science 979, Springer-Verlag, 213-226
3. Dahlhaus, E. (1998) Linear time algorithm to recognize clustered planar graphs and its parallelization (extended abstract). In C. L. Lucchesi (ed.) LATIN '98, 3rd Latin American symposium on theoretical informatics, Campinas, Brazil, Lecture Notes in Computer Science 1380, 239-248
4. Fialko, S., Mutzel, P. (1998) A new approximation algorithm for the planar augmentation problem. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '98), San Francisco, California, ACM Press, 260-269
5. Frank, A. (1992) Augmenting graphs to meet edge-connectivity requirements. SIAM J. Discrete Mathematics 5 (1), 25-53
6. Gutwenger, C., Jünger, M., Leipert, S., Mutzel, P., Percan, M., Weiskircher, R. (2002) Advances in c-planarity testing of clustered graphs. Technical report, Institut für Informatik, Universität zu Köln, zaik2002-436.
7. Gutwenger, C., Jünger, M., Leipert, S., Mutzel, P., Percan, M., Weiskircher, R. (2002) Subgraph induced planar connectivity augmentation. Technical report, Institut für Informatik, Universität zu Köln, zaik2002-435.
8. Gutwenger, C., Jünger, M., Leipert, S., Mutzel, P., Percan, M., Weiskircher, R. (2003) Advances in c-planarity testing of clustered graphs. In M. T. Goodrich and S. G. Kobourov (eds.) Graph Drawing (Proc. 2002), Lecture Notes in Computer Science 2528, Springer-Verlag, 220-235
9. Gutwenger, C., Mutzel, P. (2001) A linear time implementation of SPQR-trees. In J. Marks (ed.) Graph Drawing (Proc. 2000), Lecture Notes in Computer Science 1984, Springer-Verlag, 77-90
10. Kant, G., Bodlaender, H. L. (1991) Planar graph augmentation problems. In Proc. 2nd Workshop Algorithms Data Struct., Lecture Notes in Computer Science 519, Springer-Verlag, 286-298
11. Khuller, S. (1997) Approximation Algorithms for Finding Highly Connected Subgraphs. In Hochbaum, D. S. (ed.), PWS Publishing Company, Boston, 236-265
12. Lovász, L. (1979) Combinatorial Problems and Exercises. North-Holland.
13. Mutzel, P. (1995) A polyhedral approach to planar augmentation and related problems. In P. Spirakis (ed.) Algorithms - ESA '95, Third Annual European Symposium, Lecture Notes in Computer Science 979, Springer-Verlag, 494-507
14. De Simone, C., Jünger, M. (1997) On the two-connected planar spanning subgraph polytope. Discrete Applied Mathematics 80 (229), 223-229
15. Stoer, M. (1992) Design of Survivable Networks, Lecture Notes in Mathematics 1531. Springer-Verlag, Berlin