A minimum spanning tree algorithm with inverse-ackermann type complexity

Journal of the ACM

Volumn 47, Issue 6, 2000, Pages 1028-1047

  Chazelle, Bernard ^a,b,c  

^a PRINCETON UNIVERSITY   (United States)

^b NEC LABORATORIES AMERICA   (United States)

^c Princeton University   (United States)

Author keywords

Graphs; Matroids; Minimum spanning trees

Indexed keywords

ACKERMANN FUNCTIONS; MINIMUM SPANNING TREES (MST); PROBLEM COMPLEXITY; VERTICES;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COSTS; GRAPH THEORY; MATRIX ALGEBRA; TREES (MATHEMATICS);

PROBLEM SOLVING;

EID: 0012574730     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/355541.355562     Document Type: Article

References (18)

1. BORŮVKA, O. 1926. O jistém problému minimálním. Práce Moravské Pr̂irodovědecké Společnosti 3, 37-58 (in Czech).
2. CHAZELLE, B. 2000. Tlie soft heap: an approximate priority queue with optimal error rate. J. ACM 47, 6 (Nov.), 000-000.
3. CHAZELLE, B., ROSENBERG, B. 1991. The complexity of computing partial sums off-line. Int. J. Comput. Geom. Appl. 1, 33-45.
4. CHERITON, D., TARJAN, R. E. 1976. Finding minimum spanning trees, SIAM J. Comput. 5, 724-742.
5. DIXON, B., RAUCH, M., TARJAN, R. E. 1992. Verification and sensitivity analysis of minimum spanning trees in linear time. SIAM J. Comput. 21, 1184-1192.
6. FREDMAN, M. L., TARJAN, R. E. 1987. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 596-615.
7. FREDMAN, M. L., WILLARD, D. E. 1993. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. Comput. Syst. Sei. 48, 424-436.
8. GABOW, H. N., GALIL, Z., SPENCER, T., TARJAN, R. E. 1986. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica 6, 109-122.
9. GRAHAM, R. L., HELL, P. 1985. On the history of the minimum spanning tree problem. Ann. Hist. Comput. 7, 43-57.
10. KARGER, D. R., KLEIN, P. N., TARJAN, R. E. 1995. A randomized linear-time algorithm to find minimum spanning trees. /. ACM 42, 321-328.
11. KING, V. 1997. A simpler minimum spanning tree verification algorithm. Algorithmica 18, 263-270.
12. KOMLÓS, J. 1983. Linear verification for spanning trees. Combinatorica 5, 57-65.
13. NEŠETŘIL, J. 1997. A few remarks on the history of MST-problem. Arch. Math. Brno 33, 15-22.
14. SHARIR, M., AGARWAL, P. K. 1995. Davenport-Schinzel sequences and their geometric applications. Cambridge Univ. Press.
15. TARJAN, R. E. 1975. Efficiency of a good but not linear set-union algorithm. /. ACM 22, 215-225.
16. TARJAN, R. E. 1978. Complexity of monotone networks for computing conjunctions. Ann. Disc. Math. 2, 121-133.
17. TARJAN, R. E. 1983. Data Structures and Newark Algorithms. SIAM, Philadelphia, Pa.
18. YAO, A. 1975. An O(|E|log log|V|) algorithm for finding minimum spanning trees. Inf. Process. Lett. 4, 21-23.