18 search results - page 1 / 4 » Point-to-Point Shortest Path Algorithms with Preprocessing |
SOFSEM
2007
Springer
13 years 11 months ago
2007
Springer
FCT
1995
Springer
13 years 8 months ago
1995
Springer
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
ICALP
1995
Springer
13 years 8 months ago
1995
Springer
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be efï...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
CORR
2012
Springer
12 years 17 days ago
2012
Springer
Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let f be an arbitrary face of G. We describe an alg...