Augmenting Outerplanar Graphs

Journal of Algorithms

Volumn 21, Issue 1, 1996, Pages 1-25

  Kant, Goos ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

LINEAR TIME; MAXIMAL GRAPH; PLANAR GRAPH; POLYNOMIAL TIME;

GRAPH THEORY;

EID: 0030365919     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0034     Document Type: Article

References (32)

1. K. S. Booth and G. S. Lueker, Testing for the consecutive ones property, interval graphs and graph planarity testing using PQ-tree algorithms, J. Comput. System Sci. 13 (1976), 335-379.
2. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis, Algorithms for automatic graph drawing: An annotated bibliography, Comp. Geometry Theory Appl. 4 (1994), 235-282.
3. H. Edelsbrunner, "Triangulations," Tech. Report CS 497, Dept. of Comp. Science, Univ. of Illinois at Urbana-Champaign, 1991.
4. H. Edelsbrunner and T. S. Tan, A quadratic time algorithm for the minmax length triangulation, in "Proc. 32nd Annual IEEE Symp. on Found, of Comp. Science, 1991," pp. 548-559.
5. 2 log n) time algorithm for the minmax angle triangulation, in "Proc. 6th Annual ACM Symp. on Computational Geometry, 1990," pp. 44-52.
6. K. P. Eswaran and R. E. Tarjan, Augmentation problems, SIAM J. Comput. 5 (1976), 653-665.
7. G. N. Frederickson and J. Ja'Ja, Approximation algorithms for several graph augmentation problems, SIAM J. Comput. 10 (1981), 270-283.
8. A. Frank, Augmenting graphs to meet edge-connectivity requirements, in Proc. 31st Annual IEEE Symp. on Found, on Comp. Science, 1990," pp. 708-718.
9. H. N. Gabow, Applications of a poset representation to edge connectivity and graph rigidity, in "Proc. 32nd Annual IEEE Symp. on Found, of Comp. Science, 1991," pp. 812-821.
10. A. Garg and R. Tamassia, Planar drawings and angular resolution: Algorithms and bounds, in "Proc. 2nd European Symposium on Algorithms (ESA '94), 1994," pp. 12-23.
11. F. Harary, "Graph Theory," Addison-Wesley, Reading, MA, 1969.
12. T.-S. Hsu, On four-connecting a triconnected graph, in "Proc. 33rd Annual IEEE Symp. on Found, of Comp. Science, 1992," pp. 70-79.
13. T.-S. Hsu and V. Ramachandran, A linear time algorithm for triconnectivity augmentation, in "Proc. 32nd Annual IEEE Symp. on Found, of Comp. Science, 1991," pp. 548-559.
14. T.-S. Hsu and V. Ramachandran, On finding a smallest augmentation to biconnect a graph, in "Proc. 2nd Annual Int. Symp. on Algorithms," Lecture Notes in Computer Science, Vol. 557, pp. 326-335, Springer-Verlag, Berlin/New York, 1992.
15. Deleted in proof.
16. G. Kant, "Algorithms for Drawing Planar Graphs," Ph.D. thesis, Dept. of Computer Science, Utrecht University, 1993.
17. Deleted in proof.
18. G. Kant and H. L. Bodlaender, Triangulating planar graphs while minimizing the maximum degree, in "Proc. 3rd Scand. Workshop on Algorithm Theory," Lecture Notes in Comp. Science, Vol. 621, pp. 258-271, Springer-Verlag, Berlin/New York, 1992.
19. Deleted in proof.
20. Y.-L. Lin and S. S. Skiena, "Complexity Aspects of Visibility Graphs," Report 92-08, Dept. of Comp. Science, State Univ. of New York, Stony Brook, 1992.
21. S. Malitz and A. Papakostas, On the angular resolution of planar graphs, in "Proc. 24th Annual ACM Symp. Theory of Computing, 1992," pp. 527-538.
22. J. Manning and M. J. Atallah, "Fast Detection and Display of Symmetry in Outerplanar Graphs," Technical Report CSD-TR-606, Dept. of Computer Sciences, Purdue Univ., West Lafayette, IN, 1986.
23. S. L. Mitchell, Linear algorithms to recognize outerplanar and maximal outerplanar graphs, Inform. Process. Lett. 9 (1979), 229-232.
24. D. Naor, D. Gusfield, and C. Martel, A fast algorithm for optimally increasing the edge-connectivity, in "Proc. 31st Annual IEEE Symp. on Found. of Comp. Science, 1990," pp. 698-707.
25. R. C. Read, A new method for drawing a graph given the cyclic order of the edges at each vertex, Congr. Numer. 56 (1987), 31-44.
26. A. Rosenthal and A. Goldner, Smallest augmentations to biconnect a graph, SIAM J. Comput. 6 (1977), 55-66.
27. R. E. Tarjan, A note on finding the bridges of a graph, Inform. Process. Lett. 2 (1974), 160-161.
28. W. T. Tutte, Convex representations of graphs, Proc. London Math. Soc. 10 (1960), 304-320.
29. T. Watanabe, Y. Higashi, and A. Nakamura, Graph augmentation problems for a specified set of vertices, in "Proc. 1st Annual Int. Symp. on Algorithms," Lecture Notes in Comp. Science, Vol. 450, pp. 378-387, Springer-Verlag, Berlin/New York, 1990.
30. T. Watanabe and A. Nakamura, Edge-connectivity augmentation problems, J. Comput. System Sci. 35 (1987), 96-144.
31. T. Watanabe and A. Nakamura, 3-connectivity augmentation problems, in "Proc. 1988 IEEE Int. Symp. on Circuits and Systems," pp. 1847-1850.
32. T. Watanabe, M. Yamakado, and K. Onaga, A linear time augmenting algorithm for 3-edge-connectivity augmentation problems, in "Proc. 1991 IEEE Int. Symp. on Circuits and Systems," pp. 1168-1171.