# Shortest paths in graphs with integral weights

Thorup ’03, directed graphs, $O(m + n \log\log n)$, by integral priority queue
Thorup ’99, undirected graphs, $O(m)$, by hierarchical bucketing.

van Emde Boas ’77, $O(m \log\log C)$,
Thorup ’03, $O(m + n \log\log C)$.

Survey: Zwick ’01.

Advertisements

### Author: hcsoso

Ph.D. student in the Department of Computer Science, University of Illinois at Urbana-Champaign.