Keywords
- Short Path
- Capacity Constraint
- Infeasible Solution
- Original Solution
- Flow Level
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. G. Busacker and T. L. Saaty, Finite Graphs and Networks (McGraw-Hill, New York, 1965).
E. Dijkstra, A Note on Two Problems in Connection with Graphs, Numberische Mathematik 1 (1959) 269–271.
R. W. Floyd, Algorithm 97-Shortest Path, Comm. ACM 5 (1962) 345.
National Cooperative Highway Research Program Report 58 (1968).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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
