Incremental minimum spanning tree algorithms

Laura Ciupala, Adrian Deaconu, Delia Spridon
2020 SERIES III - MATEMATICS, INFORMATICS, PHYSICS  
There are several types of problems that can be modeled and solved as minimum spanning tree problems. Sometimes the weighted graph in which we need to determine a minimum spanning tree differs from another weighted graph, in which a minimum spanning tree is already established, only by an edge weight (which is reduced or augmented by a units). We will describe algorithms that determine minimum spanning trees in the new weighted graphs starting from a minimum spanning tree in the original
more » ... d graph. 2000 Mathematics Subject Classification: 90B10, 90C90.
doi:10.31926/but.mif.2020.13.62.1.25 fatcat:ci2srf4xfbbz3ksanhhwu73hpu