The Filter-Kruskal Minimum Spanning Tree Algorithm

DOI10.1137/1.9781611972894.5MaRDI QIDQ5233565zbMATH OpenOpenAlexFDO

Authors Vitaly Osipov, Peter Sanders, Johannes Singler

Publication date 11 September 2019

Published in 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Analysis of algorithms (68W40)

Recommendations

• An optimal minimum spanning tree algorithm
• scientific article; zbMATH DE number 1670813
• An algorithm for \(k^{\text{th}}\) minimum spanning tree
• Minimum spanning hypertrees
• Minimum Spanning Trees in k-Dimensional Space
• Minimum spanning trees
• Minimal spanning trees
• A randomized linear-time algorithm to find minimum spanning trees

Cited in

(4)

• Kruskal with embedded c-semirings to solve MST problems with partially-ordered costs
• Some theoretical links between shortest path filters and minimum spanning tree filters
• Tree Filtering: Efficient Structure-Preserving Smoothing With a Minimum Spanning Tree
• Power tree filter: a theoretical framework linking shortest path filters and minimum spanning tree filters

This page was built for publication: The Filter-Kruskal Minimum Spanning Tree Algorithm

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