Abstract
We propose strictly polynomial-time algorithms for a number of network problems: (a) strength and reinforcement of a network. (b) attack and density of a network. (c) packing, covering, and partitioning of a network into spanning trees. The proposed algorithms are either new or have lower complexity than previously published algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature Cited
W. H. Cunningham, “Optimal attack and reinforcement of a network,” J. ACM,32, 549–561 (1985).
D. Gusfeld, “Connectivity and edge disjoint spanning trees,” Inform. Proc. Lett.,16, 87–89 (1983).
J. Edmonds, “Min partition of a matroid into independent subsets,” J. Res. Nat. Bureau Stand.,B 69, 65–72 (1965).
G. M. Adel'son-Vel'skii, E. A. Dinits, and A. V. Karzanov, Flow Algorithms [in Russian], Nauka, Moscow (1975).
A. V. Goldberg and R. E. Tarjan, “A new approach to the maximum flow problem,” J. ACM,35, 921–940 (1988).
S. Toida, “Decomposition of a graph into dense subgraphs,” IEEE Trans. Circuits Syst.,32, 583–589 (1985).
J.-C. Picard and M. Queranne, “Selected applications of minimum cuts in networks,” INFOR. J.,20, 394–422 (1982).
W. H. Cunningham, “Minimum cuts, modular functions and matroid polyhedra,” Networks,15, 205–215 (1985).
V. A. Trubin, “Determining the strength of a graph,” Dokl. Akad. Nauk SSSR,316, 1065–1069 (1991).
Additional information
Translated from Kibernetika, No. 2, pp. 67–75, March–April, 1991.
Rights and permissions
About this article
Cite this article
Trubin, V.A. Strength and reinforcement of a network and tree packing. Cybern Syst Anal 27, 246–257 (1991). https://doi.org/10.1007/BF01068376
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068376