Change one edge of the MST

Question

Change one edge of the MST

What is the best algorithm for finding MST in a new graph G '(E, V, w') where we increase the weight of one edge in graph G (an edge may or may not be in the original MST).

I read that it can be done in sqrt (E), but I haven't found an algorithm.

Thank...

+3

algorithm graph tree minimum-spanning-tree

brianch 12 jan. 15 at 21:18

source to share

No one has answered this question yet

Check out similar questions:

1815

What is the optimal algorithm for a 2048 game?

1518

Image processing: improvement of the algorithm for the recognition of "Coca-Cola Can"

1032

Ukkonen Suffix Tree Algorithm in Plain English

485

What algorithms calculate directions from point A to point B on the map?

6

Find all critical edges of the MST

2

Minimum spanning trees on two plots with some common edges

2

Linear algorithm to create unique weights

1

Change to non-MST-edge in graph to change MST

0

Need MST edges in graph

-2

When does the MST-based approximation algorithm fail to return the optimal solution for the TSP?

Change one edge of the MST

More articles: