A three-phase approximate MST algorithm using ANN graphs, random component linking, and local edge refinement achieves near-linear scaling with small error on large high-dimensional data.
Fast euclidean minimum spanning tree: algorithm, analysis, and applications,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data
A three-phase approximate MST algorithm using ANN graphs, random component linking, and local edge refinement achieves near-linear scaling with small error on large high-dimensional data.