An optimal minimum spanning tree algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1853, Issue , 2000, Pages 49-60

  Pettie, Seth ^a   Ramachandran, Vijaya ^a  

^a University of Texas at Austin   (United States)

Author keywords

Graph algorithms; Minimum spanning tree; Optimal complexity

Indexed keywords

AUTOMATA THEORY; CLUSTERING ALGORITHMS; DECISION TREES; PARALLEL PROCESSING SYSTEMS;

ALGORITHMIC COMPLEXITY; DETERMINISTIC ALGORITHMS; GRAPH ALGORITHMS; MINIMUM SPANNING FORESTS; MINIMUM SPANNING TREE PROBLEM; MINIMUM SPANNING TREES; OPTIMAL COMPLEXITY; POINTER MACHINES;

COMPUTATIONAL COMPLEXITY;

EID: 84974577684     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_6     Document Type: Conference Paper

References (22)

1. N. Alon, J. Spencer. The Probabilistic Method. Wiley, New York, 1992.
2. O. Borůvka. O jistèm problèmu minimaàlnìm. Moravskè Přìrodovĕdeckè Společnosti 3, pp. 37-58, 1926. (In Czech).
3. B. Chazelle. A faster deterministic algorithm for minimum spanning trees. In FOCS ‘97, pp. 22-31, 1997.
4. B. Chazelle. Car-pooling as a data structuring device: The soft heap. In ESA ‘98 (Venice), pp. 35-42, LNCS 1461, Springer, 1998.
5. B. Chazelle. A minimum spanning tree algorithm with inverse-Ackermann type complexity. NECI Technical Report 99-099, 1999.
6. K. W. Chong, Y. Han and T. W. Lam. On the parallel time complexity of undirected connectivity and minimum spanning trees. In Proc. SODA, pp. 225-234, 1999.
7. E. W. Dijkstra. A note on two problems in connexion with graphs. In Numer. Math., 1, pp. 269-271, 1959.
8. B. Dixon, M. Rauch, R. E. Tarjan. Verification and sensitivity analysis of minimum spanning trees in linear time. SIAM Jour. Comput., vol 21, pp. 1184-1192, 1992.
9. P. Erdös, A. Rènyi On the evolution of random graphs. Bull. Inst. Internat. Statist. 38, pp. 343-347, 1961.
10. M. L. Fredman, R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. In JACM 34, pp. 596-615, 1987.
11. M. Fredman, D. E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. In Proc. FOCS ‘90, pp. 719-725, 1990.
12. H. N. Gabow, Z. Galil, T. Spencer, R. E. Tarjan. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. In Combinatorica 6, pp. 109-122, 1986.
13. R. L. Graham, P. Hell. On the history of the minimum spanning tree problem. Annals of the History of Computing 7, pp. 43-57, 1985.
14. V. Jarnìk. O jistèm problèmu minimaàlnìm. Moravskè Přìrodovĕdeckè Společnosti 6, pp. 57-63, 1930. (In Czech).
15. D. R. Karger, P. N. Klein, and R. E. Tarjan. A randomized linear-time algorithm to find minimum spanning trees. JACM, 42:321-328, 1995.
16. R. M. Karp, R. E. Tarjan. Linear expected-time algorithms for connectivity problems. J. Algorithms 1 (1980), no. 4, pp. 374-393.
17. L. L. Larmore. An optimal algorithm with unknown time complexity for convex matrix searching. IPL, vol. 36, pp. 147-151, 1990.
18. S. Pettie, V. Ramachandran. A randomized time-work optimal parallel algorithm for finding a minimum spanning forest Proc. RANDOM ‘99, LNCS 1671, Springer, pp. 233-244, 1999.
19. S. Pettie, V. Ramachandran. An optimal minimum spanning tree algorithm. Tech Report TR99-17, Univ. of Texas at Austin, 1999.
20. S. Pettie. Finding minimum spanning trees in O(mα(m; n)) time. Tech Report TR99-23, Univ. of Texas at Austin, 1999.
21. R. C. Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, 36:1389-1401, 1957.
22. R. E. Tarjan. A class of algorithms which require nonlinear time to maintain disjoint sets. In JCSS, 18(2), pp 110-127, 1979