The Filter-Kruskal Minimum Spanning Tree Algorithm

DOI10.1137/1.9781611972894.5zbMATH Open1430.68233OpenAlexW4210981865MaRDI QIDQ5233565

Peter Sanders, Vitaly Osipov, 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

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

Related Items (1)

Tree Filtering: Efficient Structure-Preserving Smoothing With a Minimum Spanning Tree

Recommendations

• Unnamed Item 👍 👎
• An algorithm for \(k^{\text{th}}\) minimum spanning tree 👍 👎
• Minimum spanning trees 👍 👎
• Minimum spanning hypertrees 👍 👎
• An optimal minimum spanning tree algorithm 👍 👎
• Minimum Spanning Trees in k-Dimensional Space 👍 👎
• A randomized linear-time algorithm to find minimum spanning trees 👍 👎
• Minimal spanning trees 👍 👎

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