Incremental minimum spanning tree algorithms

DOI10.31926/BUT.MIF.2020.13.62.1.25MaRDI QIDQ5161537zbMATH OpenOpenAlexFDO

Authors Adrian Deaconu, Delia Spridon, Laura Ciupală

Publication date 29 October 2021

Published in SERIES III - MATEMATICS, INFORMATICS, PHYSICS (Search for Journal in Brave)

Full work available at URL https://doi.org/10.31926/but.mif.2020.13.62.1.25

zbMATH Keywords

minimum spanning treegraph algorithmsincremental algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10)

Recommendations

• Minimum spanning trees in networks with varying edge weights
• Increasing the Weight of Minimum Spanning Trees
• Incremental network design with minimum spanning trees
• An algorithm for inverse minimum spanning tree problem
• The minimum weight spanning tree with constraints

Cited in

(9)

• Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
• Incremental Algorithm for Hierarchical Minimum Spanning Forests and Saliency of Watershed Cuts
• A linear programming approach to increasing the weight of all minimum spanning trees
• Increasing the Weight of Minimum Spanning Trees
• Offline Algorithms for Dynamic Minimum Spanning Tree Problems
• An improved minimum spanning tree algorithm based on the same weight of edges
• Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs
• Incremental network design with minimum spanning trees
• Path Minima in Incremental Unrooted Trees

This page was built for publication: Incremental minimum spanning tree algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5161537)