regenerating Minimum Spanning Tree in linear time?

527 Views Asked by At

If there is a graph G with V vertices and E edges and I already know its minimum spanning tree T of G, and then if some of the edges from E are taken and their weights are increased by say 50, these edges may or may not be in the minimum spanning tree. Keeping the above scenario in mind is there a way to regenerate a new minimum spanning tree in linear time ? note: the number of edges whose weights have been modified are only 5.

1

There are 1 best solutions below

2
On

You may want to take a look at the SO question here . I believe this is directly addressed in this paper by Szpira & Pan and can be done in O(n) time .