Finding the k most vital edges with respect to minimum spanning tree
Author:
- Hong ShenHSHong Shen
- 22 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 255-262
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Increasing the Weight of Minimum Spanning TreesJournal of Algorithms, 1999
- The most vital edges in the minimum spanning tree problemInformation Processing Letters, 1993
- 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
- Parallel Merge SortSIAM Journal on Computing, 1988
- 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