Simpler and faster biconnectivity augmentation

Journal of Algorithms

Volumn 45, Issue 1, 2002, Pages 55-71

  Hsu, Tsan Sheng ^a  

^a INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTION EVALUATION; GRAPHIC METHODS; INTEGER PROGRAMMING; LINEAR SYSTEMS; MAXIMUM PRINCIPLE; OPTIMIZATION; PROBLEM SOLVING; SEQUENTIAL MACHINES; TIME DOMAIN ANALYSIS; TREES (MATHEMATICS);

ACKERMAN FUNCTION; MAXIMUM INTEGER; NONNEGATIVE INTEGERS; SEQUENTIAL LINEAR TIME; UNDIRECTED GRAPH;

PARALLEL ALGORITHMS;

EID: 0036811829     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(02)00223-7     Document Type: Article

References (23)

1. K.W. Chong, Y. Han, T.W. Lam, Concurrent threads and optimal parallel minimum spanning trees algorithm, J. ACM 48 (2) (2001) 297-323.
2. R. Cole, U. Vishkin, Approximate parallel scheduling. Part II: Applications to logarithmic-time optimal graph algorithms, Inform. and Comput. 92 (1991) 1-47.
3. K.P. Eswaran, R.E. Tarjan, Augmentation problems, SIAM J. Comput. 5 (1976) 653-665.
4. A. Frank, Connectivity augmentation problems in network design, in: J.R. Birge, K.G. Murty (Eds.), Mathematical Programming: State of the Art 1994, Univ. of Michigan, 1994, pp. 34-63.
5. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.
6. T.-s. Hsu, Graph augmentation and related problems: Theory and practice, PhD thesis, University of Texas at Austin, 1993.
7. T.-s. Hsu, Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation (extended abstract), in: J. Staples (Ed.), Proceedings of the 6th International Symposium on Algorithms and Computation, in: Lecture Notes in Comput. Sci., Vol. 1004, Springer-Verlag, New York, NY, 1995, pp. 274-283.
8. T.-s. Hsu, On four-connecting a triconnected graph, J. Algorithms 35 (2000) 202-234.
9. T.-s. Hsu, Simpler and faster vertex-connectivity augmentation algorithms (extended abstract), in: M. Paterson (Ed.), Proceedings of the 8th European Symposium on Algorithms, in: Lecture Notes in Computer Science, Vol. 1879, Springer-Verlag, New York, NY, 2000, pp. 278-289.
10. T.-s. Hsu, M.Y. Kao, A unifying augmentation algorithm for two-edge connectivity and biconnectivity, J. Combin. Optim. 2 (1998) 237-256.
11. T.-s. Hsu, V. Ramachandran, A linear time algorithm for triconnectivity augmentation, in: Proceedings of the 32th Annual IEEE Symposium on Foundations of Computer Science, 1991, pp. 548-559.
12. T.-s. Hsu, V. Ramachandran, On finding a smallest augmentation to biconnect a graph, SIAM J. Comput. 22 (1993) 889-912.
13. T. Jordán, Connectivity Augmentation Problems in Graphs, PhD thesis, Eötvös University, Budapest, 1994.
14. T. Jordán, On the optimal vertex connectivity augmentation, J. Combin. Theory Ser. B 63 (1995) 8-20.
15. T.-H. Ma, On the biconnectivity augmentation problem, in: Proceedings of CTS Workshop on Combinatorics and Algorithms, Acad. Sinica, Taipei, 21-23 December, 1998, pp. 66-73, National Center for Theoretical Sciences and Institute of Information Science, Taiwan, ROC.
16. H. Nagamochi, Recent development of graph connectivity augmentation algorithms, IEICE Trans. Inform. System E83-D (2000), 372-383.
17. J. Plesnik, Minimum block containing a given graph, Arch. Math. 27 (1976) 668-672.
18. V. Ramachandran, Parallel open ear decomposition with applications to graph biconnectivity and triconnectivity, in: J.H. Reif (Ed.), Synthesis of Parallel Algorithms, Kaufmann, 1993, pp. 275-340.
19. A. Rosenthal, A. Goldner, Smallest augmentations to biconnect a graph, SIAM J. Comput. 6 (1977) 55-66.
20. R.E. Tarjan, Depth-first search and linear graph algorithms, SIAM J. Comput. 1 (1972) 146-160.
21. R.E. Tarjan, U. Vishkin, An efficient parallel biconnectivity algorithm, SIAM J. Comput. 14 (1985) 862-874.
22. L.G. Valiant, Parallelism in comparison problems, SIAM J. Comput. (1975) 348-355.
23. T. Watanabe, A. Nakamura, A minimum 3-connectivity augmentation of a graph, J. Comput. System Sci. 46 (1993) 91-128.