425 search results - page 7 / 85 » A Fully Dynamic Algorithm for Distributed Shortest Paths |
138
Voted
DATE
2008
IEEE
15 years 8 months ago
2008
IEEE
A novel routing algorithm, named Balanced Adaptive Routing Protocol (BARP), is proposed for NoCs to provide adaptive routing and ensure deadlock-free and livelock-free routing at ...
131
Voted
IWANN
1997
Springer
15 years 6 months ago
1997
Springer
: The path planning problem is relevant for all applications in which a mobil robot should autonomously navigate. Finding the shortest path in an environment that is only partialy ...
120
click to vote
MICS
2008
15 years 2 months ago
2008
Multi-level overlay graphs represent a speed-up technique for shortest paths computation which is based on a hierarchical decomposition of a weighted directed graph G. They have b...
115
Voted
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
We present a study of multithreaded implementations of Thorup’s algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs. Our implementations l...
118
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....