Abstract
A setE′ ofk edges in a multigraphG=(V,E) is said to be ak most vital edge set (k-MVE set) if these edges being removed fromG, the resultant graphG′=(V,E −E′) has minimum number of spanning trees. The problem of finding ak-MVE set for two-terminal series-parallel graphs is considered in this paper. We present anO (|E|) time algorithm for the casek=1, and anO(|V|k+|E|) time algorithm for arbitraryk.
Similar content being viewed by others
References
A. V. Aho, J. E. Hopcroft and J. D. Ullman,The Design and Analysis of Computer Algorithms, 54–55, Addison-Wesley, Reading, MA, 1974.
M. O. Ball, B. L. Golden and R. V. Vohra,Finding the most vital arcs in a network, Operations Research Letters, 8, 73–76 (1989).
C. J. Colbourn,The Combinatorics of Network Reliability, 49–53, Oxford University Press, Oxford, England, 1987.
H. W. Corley and D. Y. Sha,Most vital links and nodes in weighted networks, Operations Research Letters, 1, 157–160 (1982).
R. J. Duffin,Topology of series-parallel networks, Journal of Mathematical Analysis and Applications, 10, 303–318 (1965).
R. Gould,Graph Theory, Benjamin/Cummings, Menlo Park, CA, 1988.
S. H. Lubore, H. D. Ratliff and G. T. Sicilia,Determining the most vital links in a flow network, Naval Research Logistics Quarterly, 17, 497–502 (1970).
H. D. Ratliff and A. S. Rosenthal,Order-picking in a rectangular warehouse: A solvable case of the traveling salesman problem, Operations Research, 507–521 (1983).
J. Valdes, R. Tarjan, and E. L. Lawler,The recognition of series parallel digraphs, SIAM Journal on Computing, 11, 298–313 (1982).
J. A. Wald and C. J. Colbourn,Steiner trees, partial 2-trees, and minimum IFI networks, Networks, 13, 159–167 (1983).
Y. L. Wang, R. S. Chang and P. R. Chang,The tour problems in two-terminal series-parallel graphs, to appear in BIT.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jan, RH., Hsu, LH. & Lee, YY. The most vital edges with respect to the number of spanning trees in two-terminal series-parallel graphs. BIT 32, 403–412 (1992). https://doi.org/10.1007/BF02074877
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02074877