We consider the point-to-point (approximate) shortest-path query problem, which is the
following generalization of the classical single-source (SSSP) and all-pairs shortest-path …

As many readers may know, graph theory is a fundamental branch of mathematics that
explores networks made up of nodes and edges, focusing on their paths, structures, and …

A shortest-path algorithm finds a path containing the minimal cost between two vertices in a
graph. A plethora of shortest-path algorithms is studied in the literature that span across …

Computing the shortest path between two given locations in a road network is an important
problem that finds applications in various map services and commercial navigation products …

We present a randomized algorithm that computes single-source shortest paths (SSSP) in
O\left(m\log^8(n)\logW\right) time when edge weights are integral and can be negative. 1 …

Given two locations s and t in a road network, a distance query returns the minimum network
distance from s to t, while a shortest path query computes the actual route that achieves the …

We give an O(n\log^3n) algorithm that, given an n-node directed planar graph with arc
capacities, a set of source nodes, and a set of sink nodes finds a maximum flow from the …

In this work we revisit the fundamental Single-Source Shortest Paths (SSSP) problem with
possibly negative edge weights. A recent breakthrough result by Bernstein, Nanongkai and …

In this article, we show how to compute for n-vertex planar graphs in O (n 11/6 polylog (n))
expected time the diameter and the sum of the pairwise distances. The algorithms work for …

We present an O (n 1.5)-space distance oracle for directed planar graphs that answers
distance queries in O (log n) time. Our oracle both significantly simplifies and significantly …