— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
Christopher L. Barrett, Riko Jacob, Madhav V. Mara...
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...