Computing All-Pairs Shortest Paths by Leveraging Low Treewidth

01/18/2014
by   Léon R. Planken, et al.
0

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(n w_d^2 + n^2 s_d) on general graphs, where s_d andlt= 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-Warshalls as well as Johnsons 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.

READ FULL TEXT
research
09/04/2021

Improving The Floyd-Warshall All Pairs Shortest Paths Algorithm

The Floyd-Warshall algorithm is the most popular algorithm for determini...
research
05/21/2018

Distributed Algorithms for Directed Betweenness Centrality and All Pairs Shortest Paths

The betweenness centrality (BC) of a node in a network (or graph) is a m...
research
07/01/2019

Space-Efficient Vertex Separators for Treewidth

Practical applications that use treewidth algorithms have graphs with tr...
research
06/15/2020

Algorithmic Aspects of Temporal Betweenness

The betweenness centrality of a graph vertex measures how often this ver...
research
05/30/2022

Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs

We consider global problems, i.e. problems that take at least diameter t...
research
07/11/2012

A Complete Anytime Algorithm for Treewidth

In this paper, we present a Branch and Bound algorithm called QuickBB fo...
research
04/17/2023

Traversing combinatorial 0/1-polytopes via optimization

In this paper, we present a new framework that exploits combinatorial op...

Please sign up or login with your details

Forgot password? Click here to reset