Skip to main content

Critical link identification in a network

  • Contributed Papers
  • Conference paper
  • First Online:
Combinatorial Mathematics VIII

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 884))

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. G. Busacker and T. L. Saaty, Finite Graphs and Networks (McGraw-Hill, New York, 1965).

    MATH  Google Scholar 

  2. E. Dijkstra, A Note on Two Problems in Connection with Graphs, Numberische Mathematik 1 (1959) 269–271.

    Article  MathSciNet  MATH  Google Scholar 

  3. R. W. Floyd, Algorithm 97-Shortest Path, Comm. ACM 5 (1962) 345.

    Article  Google Scholar 

  4. National Cooperative Highway Research Program Report 58 (1968).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Kevin L. McAvaney

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag

About this paper

Cite this paper

Foulds, L.R. (1981). Critical link identification in a network. In: McAvaney, K.L. (eds) Combinatorial Mathematics VIII. Lecture Notes in Mathematics, vol 884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0091818

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10883-2

  • Online ISBN: 978-3-540-38792-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics