Concurrent threads and optimal parallel minimum spanning trees algorithm
Journal of the ACM (JACM)
An optimal minimum spanning tree algorithm
Journal of the ACM (JACM)
An Optimal Minimum Spanning Tree Algorithm
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Optimal per-edge processing times in the semi-streaming model
Information Processing Letters
Randomized minimum spanning tree algorithms using exponentially fewer random bits
ACM Transactions on Algorithms (TALG)
Fast euclidean minimum spanning tree: algorithm, analysis, and applications
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Research paper: The saga of minimum spanning trees
Computer Science Review
| Hi-index | 0.00 |
We describe a deterministic minimum spanning tree algorithm running in time O(m alpha(m,n)), where alpha is a natural inverse of Ackermann''s function and m and n are the number of edges and vertices, respectively. This improves upon the O(m alpha(m,n) log alpha(m,n)) bound established by Chazelle in 1997. A similar O(m alpha(m,n))-time algorithm was discovered independently by Chazelle, predating the algorithm presented here by many months. This paper may still be of interest for its alternative exposition.