Edge-splitting and edge-connectivity augmentation in planar graphs

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

Volumn 1412, Issue , 1998, Pages 96-111

  Nagamochi, Hiroshi ^a   Eades, Peter ^b  

^a KYOTO UNIVERSITY   (Japan)

^b NEWCASTLE UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; GRAPHIC METHODS; INTEGER PROGRAMMING; POLYNOMIAL APPROXIMATION;

EDGE CONNECTIVITY; EDGE-SPLITTING; ISOLATED VERTICES; MULTIGRAPHS; OUTERPLANAR GRAPH; PLANAR GRAPH; POLYNOMIAL-TIME; TIME ALGORITHMS;

GRAPH THEORY;

EID: 84958771912     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69346-7_8     Document Type: Conference Paper

References (12)

1. G.-R. Cai and Y.-G. Sun. The minimum augmentation of any graph to k-edgeconnected graph. Networks, 19:151-172, 1989.
2. A. Frank. Augmenting graphs to meet edge-connectivity requirements. SIAM J. Disc. Math., 5:25-53, 1992.
3. G. Kant. Algorithms for Drawing Planar Graphs. PhD thesis, Dept. of Computer Science, Utrecht University, 1993.
4. G. Kant. Augmenting outerplanar graphs. J. Algorithms, 21:1-25, 1996.
5. G. Kant and H. L. Boldlaender. Planar graph augmentation problems. LNCS, Vol. 621, pages 258-271. Springer-Verlag, 1992.
6. L. Lovász. Combinatorial Problems and Exercises. North-Holland, 1979.
7. H. Nagamochi and T. Ibaraki. A linear time algorithm for computing 3-edgeconnected components in multigraphs. J. of Japan Society for Industrial and Applied Mathematics, 9:163-180, 1992.
8. H. Nagamochi and T. Ibaraki. Computing edge-connectivity of multigraphs and capacitated graphs. SIAM J. Disc. Math., 5:54-66, 1992.
9. H. Nagamochi and T. Ibaraki. Deterministic Õ(nm) time edge-splitting in undirected graphs. J. Combinatorial Optimization, 1:5-46, 1997.
10. R. E. Tarjan. Depth-first search and linear graph algorithms. SIAM J. Comput., 1:146-160, 1972.
11. T. Watanabe and A. Nakamura. Edge-connectivity augmentation problems. J. Comp. System Sci., 35:96-144, 1987.
12. T. Watanabe, S. Taoka and K. Onaga. A linear-time algorithm for computing all 3-edge-components of a multigraph. Trans. Inst. Electron. Inform. Comm. Eng. Jap., E75-A:410-424, 1992.