## Directed Single-Source Shortest-Paths in Linear Average-Case Time (2001)

by
Ulrich Meyer

### BibTeX

@MISC{Meyer01directedsingle-source,

author = {Ulrich Meyer},

title = {Directed Single-Source Shortest-Paths in Linear Average-Case Time},

year = {2001}

}

### OpenURL

### Abstract

The quest for a linear-time single-source shortest-path (SSSP) algorithm on directed graphs with positive edge weights is an ongoing hot research topic. While Thorup recently found an O(n + m) time RAM algorithm for undirected graphs with n nodes, m edges and integer edge weights in f0; : : : ; 2 1g where w denotes the word length, the currently best time bound for directed sparse graphs on a RAM is O(n +m log log n). In the present paper