Partitioning graphs to speedup Dijkstra's algorithm

We study an acceleration method for point-to-point shortest-path computations in large and sparse directed graphs with given nonnegative arc weights. The acceleration method is called the arc-flag ...