1447 search results - page 22 / 290 » Graphs and Path Equilibria |
SIAMCOMP
2010
13 years 4 months ago
2010
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v ∈ V is said to be t-approximate shortest path if its length is at most t ...
TKDE
2002
13 years 9 months ago
2002
In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to the minimum cost route computation. The HiTi graph model p...
ICRA
2007
IEEE
14 years 4 months ago
2007
IEEE
— Computing optimal paths for mobile robots is an interesting and important problem. This paper presents a method to compute the shortest path for a differential-drive mobile rob...
CPM
2008
Springer
13 years 11 months ago
2008
Springer
Let G be an unweighted and undirected graph of n nodes, and let D be the n