1172 search results - page 49 / 235 » Path Algorithms on Regular Graphs |
160
click to vote
INFOCOM
2009
IEEE
16 years 20 days ago
2009
IEEE
— 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...
165
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
241
click to vote
EOR
2006
15 years 6 months ago
2006
The natural metric of a weighted graph is the length of the shortest paths between all pairs of vertices. The investigated problem consists in a representation of a given metric b...
167
click to vote
IPPS
1998
IEEE
15 years 10 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....
145
click to vote
ICRA
2010
IEEE
15 years 4 months ago
2010
IEEE
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...