Skip to main content
Log in

The most vital edges with respect to the number of spanning trees in two-terminal series-parallel graphs

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

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,EE′) 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. A. V. Aho, J. E. Hopcroft and J. D. Ullman,The Design and Analysis of Computer Algorithms, 54–55, Addison-Wesley, Reading, MA, 1974.

    Google Scholar 

  2. 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).

    Google Scholar 

  3. C. J. Colbourn,The Combinatorics of Network Reliability, 49–53, Oxford University Press, Oxford, England, 1987.

    Google Scholar 

  4. H. W. Corley and D. Y. Sha,Most vital links and nodes in weighted networks, Operations Research Letters, 1, 157–160 (1982).

    Google Scholar 

  5. R. J. Duffin,Topology of series-parallel networks, Journal of Mathematical Analysis and Applications, 10, 303–318 (1965).

    Google Scholar 

  6. R. Gould,Graph Theory, Benjamin/Cummings, Menlo Park, CA, 1988.

    Google Scholar 

  7. 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).

    Google Scholar 

  8. 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).

  9. J. Valdes, R. Tarjan, and E. L. Lawler,The recognition of series parallel digraphs, SIAM Journal on Computing, 11, 298–313 (1982).

    Google Scholar 

  10. J. A. Wald and C. J. Colbourn,Steiner trees, partial 2-trees, and minimum IFI networks, Networks, 13, 159–167 (1983).

    Google Scholar 

  11. Y. L. Wang, R. S. Chang and P. R. Chang,The tour problems in two-terminal series-parallel graphs, to appear in BIT.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02074877

C.R. Category

Keywords

Navigation