Trans-dichotomous algorithms for minimum spanning trees and shortest paths

Journal of Computer and System Sciences

Volumn 48, Issue 3, 1994, Pages 533-551

  Fredman, Michael L ^a,b   Willard, Dan E ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c STATE UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; GRAPH THEORY; INFORMATION THEORY; QUEUEING THEORY; TREES (MATHEMATICS);

FUSION TREE METHOD; MINIMUM SPANNING TREES; SHORTEST PATHS; TRANS DICHOTOMOUS ALGORITHMS;

ALGORITHMS;

EID: 0028459904     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/S0022-0000(05)80064-9     Document Type: Article

References (12)

1. R. Ahuja, K. Mehlhorn, J. Orlin, and R. Tarjan, Faster algorithms for the shortest path problem, J. Assoc. Comput. Mach. 37 (1990), 213-223.
2. M. Ajtai, M. Fredman, and J. Komlos, Hash functions for priority queues, Inform, and Comput. 63 (1984), 217-225.
3. M. Ben-Or, Lower bounds for algebraic computation trees, in “Proceedings, 15th Annual ACM Symposium on Theory of Computing, 1983,” pp. 80-86.
4. B. Dixon, M. Rauch, and R. E. Tarjan, Verification and sensitivity analysis of minimum spanning trees in linear time, unpublished manuscript.
5. J. Driscoll, H. Gabow, R. Shrairman, and R. Tarjan, An alternative to Fibonacci heaps with applications to parallel computation, Comm. ACM 31 (1988), 1343-1354.
6. M. Fredman and R. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J. Assoc. Comput. Mach. 34 (1987), 596-615.
7. M. Fredman and D. Willard, Surpassing the information theoretic bound with fusion trees, J. Comput. System Sci. 47 (1993).
8. H. Gabow, Z. Galil, T. Spencer, and R. Tarjan, Efficient algorithms for finding minimum spanning trees in undirected and directed graphs, Combinatorica 6 (1986), 109-122.
9. J. Komlos, Linear verification for spanning trees, in “Proceedings, 25 th Annual IEEE Symposium on Foundations of Computer Science, 1984,” pp. 201-206.
10. G. Peterson, “A Balanced Tree Scheme for Meldable Heaps with Updates,” Tech. Rep. GIT-ICS- 87-23, School of Information and Comput. Sci., Georgia Institute of Technology, Atlanta, GA 1987.
11. R. Tarjan, “Data Structures and Network Algorithms,” Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.
12. P. Van Emde Boas, R. Kaas, and E. Zijlstra, Design and implementation of an efficient priority queue, Math. Systems Theory 10 (1977), 99-127.