Affiliation:
1. Princeton Univ., Princeton, NJ
Abstract
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is
0
(
m
α(
m, n
)), where α is the classical functional inverse of Ackermann's function and
n
(respectively,
m
) is the number of vertices (respectively, edges). The algorithm is comparison-based : it uses pointers, not arrays, and it makes no numeric assumptions on the edge costs.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference18 articles.
1. O jistem problemu minimalnim;BORUVKA O.;Prace Moravske Prirodovedecke Spolecnosti,1926
2. The soft heap
3. The complexity of computing partial sums off-line;CHAZELLE B.;Int. J. Comput. Geom. Appl.,1991
4. Finding minimum spanning trees;CHERITON D.;SIAM J. Comput.,1976
5. Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
Cited by
183 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献