Simpler and faster vertex-connectivity augmentation algorithms

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

Volumn 1879, Issue , 2000, Pages 278-289

  Hsu, Tsan Sheng ^a  

^a INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS; ARTIFICIAL INTELLIGENCE;

UNDIRECTED GRAPH; VERTEX CONNECTIVITY;

ARTIFICIAL INTELLIGENCE; ALGORITHMS;

EID: 84927135150     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45253-2_26     Document Type: Article

References (22)

1. K. W. Chong and T. W. Lam. Finding connected components in O(log n log log n) time on the EREW PRAM. In Proceedings of SODA, pages 11–20, 1993.
2. R. Cole and U. Vishkin. Approximate parallel scheduling. Part II: Applications to logarithmic-time optimal graph algorithms. Information and Computation, 92:1–47, 1991.
3. G. Di Battista and R. Tamassia. On-line graph algorithms with SPQR-trees. Algorithmica, 15:302–318, 1996.
4. K. P. Eswaran and R. E. Tarjan. Augmentation problems. SIAM Journal on Computing, 5:653–665, 1976.
5. A. Frank. Connectivity augmentation problems in network design. In J. R. Birge and K. G. Murty, editors, Mathematical Programming: State of the Art 1994, pages 34–63. The University of Michigan, 1994.
6. D. Fussel, V. Ramachandran, and R. Thurimella. Finding triconnected components by local replacements. SIAM Journal on Computing, 22(3):587–616, 1993.
7. F. Harary. Graph Theory. Addison-Wesley, Reading, Massachusetts, 1969.
8. J. E. Hopcroft and R. E. Tarjan. Dividing a graph into triconnected components. SIAM Journal on Computing, 2:135–158, 1973.
9. T.-S. Hsu. Graph Augmentation and Related Problems: Theory and Practice. PhD thesis, University of Texas at Austin, 1993.
10. T.-S. Hsu. Undirected vertex-connectivity structure and smallest four-vertexconnectivity augmentation (extended abstract). In Springer-Verlag LNCS Vol. 1004: Proceedings of 6th Intl. Symp. on Alg. and Comp., pages 274–283, 1995.
11. T.-S. Hsu. On four-connecting a triconnected graph. Journal of Algorithms, 35:202–234, 2000.
12. T.-s. Hsu and V. Ramachandran. A linear time algorithm for triconnectivity augmentation. In Proceedings of FOCS, pages 548–559, 1991.
13. T.-s. Hsu and V. Ramachandran. On finding a smallest augmentation to biconnect a graph. SIAM Journal on Computing, 22:889–912, 1993.
14. T. Jordán. On the optimal vertex connectivity augmentation. Journal of Combinatorial Theory, Series B, 63:8–20, 1995.
15. T.-H. Ma. On the biconnectivity augmentation problem. In Proceedings of CTS Workshop on Combinatorics and Algorithms, pages 66–73. National Center for Theoretical Sciences Taiwan, December 21–23 1998.
16. J. Plesńik. Minimum block containing a given graph. ARCHIV DER MATHEMATIK, 27:668–672, 1976.
17. V. Ramachandran. Parallel open ear decomposition with applications to graph biconnectivity and triconnectivity. In J. H. Reif, editor, Synthesis of Parallel Algorithms, pages 275–340. Morgan-Kaufmann, 1993.
18. A. Rosenthal and A. Goldner. Smallest augmentations to biconnect a graph. SIAM Journal on Computing, 6:55–66, 1977.
19. R. E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1:146–160, 1972.
20. R. E. Tarjan and U. Vishkin. An efficient parallel biconnectivity algorithm. SIAM J. Comput., 14:862–874, 1985.
21. W. T. Tutte. Connectivity in Graphs. University of Toronto Press, 1966.
22. T. Watanabe and A. Nakamura. A minimum 3-connectivity augmentation of a graph. Journal of Computer and System Science, 46:91–128, 1993.