The most vital edges in the minimum spanning tree problem
Authors:
- Kao-Chêng LinKLKao-Chêng Lin
- Maw-Sheng ChernMCMaw-Sheng Chern
- 1 January 1993
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 45 (1) , 25-31
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Finding the most vital edge with respect to minimum spanning tree in weighted graphsInformation Processing Letters, 1991
- The k most vital arcs in the shortest path problemOperations Research Letters, 1990
- The k most vital arcs in the shortest path problemOperations Research Letters, 1989
- Finding the most vital arcs in a networkOperations Research Letters, 1989
- Most vital links and nodes in weighted networksOperations Research Letters, 1982
- Finding the n Most Vital Links in Flow NetworksManagement Science, 1975
- Determining the most vital link in a flow networkNaval Research Logistics Quarterly, 1971
- Removing Arcs from a NetworkOperations Research, 1964