Efficiently computing directed minimum spanning trees

DOI10.1137/1.9781611977561.CH8MaRDI QIDQ6543541zbMATH OpenFDO

Authors Maximilian Böther, Otto Kißig, Christopher Weyand

Publication date 24 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977561.CH8

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Recommendations

• An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• Arborescence optimization problems solvable by Edmonds' algorithm
• Minimum-weight spanning tree algorithms. A survey and empirical study

Cited in

(1)

• Optimization of the directed spanning trees using the weighted matroid intersection algorithm

This page was built for publication: Efficiently computing directed minimum spanning trees

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