Yet another efficient algorithm for replacing the edges of a minimum spanning tree
CSC '96 Proceedings of the 1996 ACM 24th annual conference on Computer science
Increasing the weight of minimum spanning trees
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
The optimum sensor redeployment scheme using the most frangible clusters set
Computer Communications
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
| Hi-index | 0.90 |