Abstract
We present Filter-Kruskal - a simple modification of Kruskal's algorithm that avoids sorting edges that are "obviously" not in the MST. For arbitrary graphs with random edge weights Filter-Kruskal runs in time Ø(m + n log n log m/n), i.e. in linear time for not too sparse graphs. Experiments indicate that the algorithm has very good practical performance over the entire range of edge densities. An equally simple parallelization seems to be the currently best practical algorithm on multicore machines. Copyright © by SIAM.
Cite
CITATION STYLE
Osipov, V., Sanders, P., & Singler, J. (2009). The Filter-Kruskal minimum spanning tree algorithm. In 2009 Proceedings of the 11th Workshop on Algorithm Engineering and Experiments, ALENEX 2009 (pp. 52–61). Society for Industrial and Applied Mathematics Publications. https://doi.org/10.1137/1.9781611972894.5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
