Single-source shortest-paths on arbitrary directed graphs in linear average-case time


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 <i>&Ogr;</i>(<i>n</i> + <i>m</i>) time RAM algorithm for undirected graphs with <i>n</i> nodes, <i>m</i> edges and integer edge weights in {0,…,2<sup>w</sup> - 1} where <i>w… (More)

3 Figures and Tables


  • Presentations referencing similar topics