Title :
A faster deterministic algorithm for minimum spanning trees
Author_Institution :
Dept. of Comput. Sci., Princeton Univ., NJ
Abstract :
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m α log α), where α=α(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)
Keywords :
computational complexity; deterministic algorithms; trees (mathematics); connected graph; deterministic algorithm; minimum spanning trees; running time; Computational modeling; Computer science; Costs; History; Partitioning algorithms; Tree graphs;
Conference_Titel :
Foundations of Computer Science, 1997. Proceedings., 38th Annual Symposium on
Conference_Location :
Miami Beach, FL
Print_ISBN :
0-8186-8197-7
DOI :
10.1109/SFCS.1997.646089
