Abstract
In this paper, we give an O(n·log n+m)-time algorithm to solve the problem of finding a smallest set of edges whose addition 4-vertex-connects an undirected graph, where n and m are the number of vertices and edges in the input graph, respectively. We also show a formula to compute this smallest number in O(n·α(n,n)+m) time, where α is the inverse of the Ackermann function.
Research supported in part by NSC under the Grant No. 84-2213-E-001-005.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
G. Di Battista and R. Tamassia. On-line graph algorithms with SPQR-trees. In Proc. 17th ICALP, volume LNCS # 443, pages 598–611. Springer-Verlag, 1990.
K. P. Eswaran and R. E. Tarjan. Augmentation problems. SIAM J. Comput., 5(4):653–665, 1976.
H. Frank and W. Chou. Connectivity considerations in the design of survivable networks. IEEE Trans. on Circuit Theory, CT-17(4):486–490, December 1970.
D. Gusfield. A graph theoretic approach to satistical data security. SIAM J. Comput., 75:552–571, 1989.
F. Harary. The maximum connectivity of a graph. Proc. Nat. Acad. Sci., 48:1142–1146, 1962.
F. Harary. Graph Theory. Addison-Wesley, Reading, MA, 1969.
J. E. Hopcroft and R. E. Tarjan. Dividing a graph into triconnected components. SIAM J. Comput., 2:135–158, 1973.
T.-s. Hsu. On four-connecting a triconnected graph (extended abstract). In FOCS'92, pages 70–79, 1992.
T.-s. Hsu. Graph Augmentation and Related Problems: Theory and Practice. PhD thesis, University of Texas at Austin, October 1993.
T.-s. Hsu and V. Ramachandran. A linear time algorithm for triconnectivity augmentation. In FOCS'91, pages 548–559, 1991.
T.-s. Hsu and V. Ramachandran. On finding a smallest augmentation to biconnect a graph. SIAM J. Comput., 22(5):889–912, 1993.
T. Jordán. Optimal and almost optimal algorithms for connectivity augmentation problems. In Proc. 3rd IPCO Conference, pages 75–88, 1993.
A. Kanevsky, R. Tamassia, G. Di Battista, and J. Chen. On-line maintenance of the four-connected components of a graph. In FOCS'91, pages 793–801, 1991.
K. Menger. Zur allgemeinen kurventheorie. Fund. Math., 10:96–115, 1927.
J. Plesník. Minimum block containing a given graph. ARCHIV DER MATHEMATIK, XXVII:668–672, 1976.
A. Rosenthal and A. Goldner. Smallest augmentations to biconnect a graph. SIAM J. Comput., 6(1):55–66, March 1977.
W. T. Tutte. Connectivity in Graphs. University of Toronto Press, 1966.
T. Watanabe and A. Nakamura. A minimum 3-connectivity augmentation of a graph. J. Comp. System Sci., 46:91–128, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hsu, Ts. (1995). Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation (extended abstract). In: Staples, J., Eades, P., Katoh, N., Moffat, A. (eds) Algorithms and Computations. ISAAC 1995. Lecture Notes in Computer Science, vol 1004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015432
Download citation
DOI: https://doi.org/10.1007/BFb0015432
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60573-7
Online ISBN: 978-3-540-47766-2
eBook Packages: Springer Book Archive