Finding the most vital edge with respect to minimum spanning tree in weighted graphs
- 1 September 1991
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 39 (5) , 277-281
- https://doi.org/10.1016/0020-0190(91)90028-g
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Finding the most vital arcs in a networkOperations Research Letters, 1989
- Most vital links and nodes in weighted networksOperations Research Letters, 1982
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956