Floats, integers, and single source shortest paths
Floats are ugly, but to everyone but theoretical computer scientists, they are the real thing. A linear time algorithm is presented for the undirected single source shortest paths problem with positive floating point weights.
KeywordsLinear Time Minimum Span Tree Priority Queue Distance Edge Floating Point
Unable to display preview. Download preview PDF.
- [AM97]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.Google Scholar
- [Tho97]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.Google Scholar