Efficient algorithms for finding the most vital edge of a minimum spanning tree

Increasing the weight of minimum spanning trees

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms

Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms

Efficient algorithms for finding the k most vital edges for the minimum spanning tree problem

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications

Efficient determination of the k most vital edges for the minimum spanning tree problem

Computers and Operations Research

Critical edges/nodes for the minimum spanning tree problem: complexity and approximation

Journal of Combinatorial Optimization