We present two new and efficient algorithms for computing all-pairs shortest paths. The algorithms operate on directed graphs with real (possibly negative) weights. They make use of directed path consistency along a vertex ordering d. Both algorithms run in O n 2 w d time, where w d is the graph width induced by this vertex ordering. For graphs of constant treewidth, this yields O n 2 time, which is optimal. On chordal graphs, the algorithms run in O (nm) time. In addition, we present a variant that exploits graph separators to arrive at a run time of O nw 2 d + n 2 s d on general graphs, where s d ≤ w d is the size of the largest minimal separator induced by the vertex ordering d. We show empirically that on both constructed and realistic benchmarks, in many cases the algorithms outperform Floyd-Warshall's as well as Johnson's algorithm, which represent the current state of the art with a run time of O n 3 and O nm + n 2 log n , respectively. Our algorithms can be used for spatial and temporal reasoning, such as for the Simple Temporal Problem, which underlines their relevance to the planning and scheduling community.
Fortunately, we can compute all-pairs shortest paths in induced graphs by leveraging low treewidth REF .
Computing All-Pairs Shortest Paths by Leveraging Low Treewidth
Journal Of Artificial Intelligence Research, Volume 43, pages 353-388, 2012
Mathematics Computer Science