Floats, integers, and single source shortest paths

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

Volumn 1373 LNCS, Issue , 1998, Pages 14-24

  Thorup, Mikkel ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENTISTS; FLOATING POINTS; LINEAR-TIME ALGORITHMS; SHORTEST PATH; SINGLE SOURCE;

GRAPH THEORY;

COMPUTER SCIENCE;

EID: 78649806711     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028545     Document Type: Conference Paper

References (7)

1. S. ALBERS AND T. HAGERUP, Improved parallel integer sorting without concurrent writing, Information and Control 136 (1997) 25-51.
2. E. ALTHAUS AND K. MEHLHORN, Maximum Network Flow with Floating Point Arithmetic, Max-Plank-Institut für Informatik, Technical Report MPI-I-97-1-022, 1997.
3. E.W. DIJKSTRA, A note on two problems in connection with graphs, Numer. Math. 1 (1959), 269-271.
4. M.L. FREDMAN AND D.E. WILLARD, Trans-dichotomous algorithms for minimum spanning trees and shortest paths, J. Comp. Syst. Sc. 48 (1994) 533-551.
5. D.R. KARGER, P.N. KLEIN, AND R.E. TARJAN, A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees J. ACM, 42:321-328, 1995.
6. M. THORUP. Undirected Single Source Shortest Paths in Linear Time. In Proceedings of the 38th IEEE Symposium on Foundations of Computer Science (FOCS), pages 12-21, 1997.
7. P. VAN EMDE BOAS, R. KAAS, AND E. ZIJLSTRA, Design and implementation of an efficient priority queue, Math. Syst. Th. 10 (1977), 99-127.