Updating Directed Minimum Cost Spanning Trees

DOI10.1007/11764298_27MaRDI QIDQ5307551zbMATH OpenOpenAlexFDO

Authors Gerasimos G. Pollatos, Orestis A. Telelis, V. Zissimopoulos

Publication date 14 September 2007

Published in Experimental Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11764298_27

zbMATH Keywords

branchingsdata structuresdynamic graph algorithms

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
• Maintaining minimum spanning trees in dynamic graphs
• A distributed algorithm for directed minimum-weight spanning tree
• Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
• Minimum spanning trees in networks with varying edge weights

Cited in

(2)

• Upgrading min-max spanning tree problem under various cost functions
• Optimization of the directed spanning trees using the weighted matroid intersection algorithm

This page was built for publication: Updating Directed Minimum Cost Spanning Trees

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