Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Approximating geometrical graphs via “spanners” and “banyans”
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On the parallel time complexity of undirected connectivity and minimum spanning trees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Concurrent threads and optimal parallel minimum spanning trees algorithm
Journal of the ACM (JACM)
ACM SIGACT News
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
Car-Pooling as a Data Structuring Device: The Soft Heap
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Decomposable multi-parameter matroid optimization problems
Theoretical Computer Science - Latin American theoretical informatics
Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions
Journal of Experimental Algorithmics (JEA)
Fast euclidean minimum spanning tree: algorithm, analysis, and applications
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Algorithms and theory of computation handbook
Operations Research Letters
Research paper: The saga of minimum spanning trees
Computer Science Review
| Hi-index | 0.00 |
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O( m \alpha\log\alpha ), where \alpha= \alpha(m,n) is a functional inverse of Ackermann's function and n (resp. m) is the number of vertices (resp. edges). This improves on the previous, ten-year old bound of (roughly) O(m\log\log^*m).