Abstract
This paper first shows that, given a multigraph G and a vertex s with even degree, all edges incident to s can be split off (i.e., if G is k-edge-connected, then the resulting multigraph is also k-edge-connected) in O(mn 2+n 2 log n) time, where n and m are the numbers of vertices and edges in G, respectively. This algorithm is unique in the sense that it does not rely on the maximum flow computations. Based on this, we then show that, given a positive integer k, the problem of making a multigraph G k-edge-connected by adding the smallest number of new edges can be solved in O(m+minen 2+n 3 log n, kn 3) time, where e (≤n 2) is the number of pairs of vertices between which G has an edge.
Preview
Unable to display preview. Download preview PDF.
References
A. A. Benczúr, Augmenting undirected connectivity in Õ(n 3) time, Proceedings 26th ACM Symposium on Theory of Computing, 1994, pp. 658–667.
G.-R. Cai and Y.-G. Sun, The minimum augmentation of any graph to k-edge-connected graph, Networks, Vol. 19, 1989, pp. 151–172.
A. Frank, Augmenting graphs to meet edge-connectivity requirements, SIAM J. Discrete Mathematics, Vol. 5, 1992, pp. 25–53.
A. Frank, T. Ibaraki and H. Nagamochi, On sparse subgraphs preserving connectivity properties, J. Graph Theory, Vol. 17, 1993, pp. 275–281.
H.N. Gabow, Applications of a poset representation to edge connectivity and graph rigidity, Proc. 32nd IEEE Symp. Found. Comp. Sci., San Juan, Puerto Rico (1991), pp. 812–821.
H.N. Gabow, Efficient splitting off algorithms for graphs, Proceedings 26th ACM Symposium on Theory of Computing, 1994, pp. 696–705.
L. Lovász, Combinatorial Problems and Exercises, North-Holland 1979.
H. Nagamochi and T. Ibaraki, Computing edge-connectivity of multigraphs and capacitated graphs, SIAM J. Discrete Mathematics, Vol. 5, 1992, pp. 54–66.
H. Nagamochi, K. Nishimura and T. Ibaraki, Computing all small cuts in undirected networks, Lectures Notes in Computer Science 834, Springer-Verlag, Ding-Zhu Du and Xiang-Sun Zhang (Eds.), Algorithms and Computation, 5th International Symposium, ISAAC'94 Beijin, Aug. 1994, pp. 190–198.
D. Naor, D. Gusfield and C. Martel, A fast algorithm for optimally increasing the edge connectivity, Proceedings 31st Annual IEEE Symposium on Foundations of Computer Science, 1990, pp. 698–707.
T. Watanabe and A. Nakarnura, Edge-connectivity augmentation problems, Comp. System Sci., Vol. 35, 1987, pp. 96–144.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nagamochi, H., Ibaraki, T. (1995). A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem. In: Balas, E., Clausen, J. (eds) Integer Programming and Combinatorial Optimization. IPCO 1995. Lecture Notes in Computer Science, vol 920. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59408-6_68
Download citation
DOI: https://doi.org/10.1007/3-540-59408-6_68
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59408-6
Online ISBN: 978-3-540-49245-0
eBook Packages: Springer Book Archive