Kruskal-EDS: Edge Dynamic Stratification
Yves Mercadier (LIRMM)

TL;DR
Kruskal-EDS is an adaptive MST algorithm that replaces global sorting with a stratification approach based on distribution estimation, achieving significant speedups especially on sparse or heavy-tailed graphs.
Contribution
It introduces a distribution-adaptive stratification method for Kruskal's MST algorithm, reducing sorting complexity and improving performance on specific graph types.
Findings
Achieves up to 10x speedup over standard Kruskal
Effective on sparse graphs and heavy-tailed distributions
Demonstrates correctness and efficiency across multiple graph families
Abstract
We introduce \textbf{Kruskal-EDS} (\emph{Edge Dynamic Stratification}), a distribution-adaptive variant of Kruskal's minimum spanning tree (MST) algorithm that replaces the mandatory global sort with a three-phase procedure inspired by Birkhoff's ergodic theorem. In Phase 1, a sample of edges estimates the weight distribution in time. In Phase 2, all edges are assigned to strata in time via binary search on quantile boundaries -- no global sort. In Phase 3, strata are sorted and processed in order; execution halts as soon as MST edges are accepted. We prove an effective complexity of , where is the number of strata actually processed. On sparse graphs or heavy-tailed weight distributions, and the algorithm achieves near- behaviour. We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Graph Theory and Algorithms · Advanced Graph Theory Research
