126 search results - page 5 / 26 » More Algorithms for All-Pairs Shortest Paths in Weighted Gra... |
CORR
2012
Springer
12 years 3 months 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...
SODA
2007
ACM
13 years 9 months ago
2007
ACM
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
WEA
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
ESA
2004
Springer
14 years 28 days ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
SIAMCOMP
2010
13 years 6 months ago
2010
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...