425 search results - page 4 / 85 » A Fully Dynamic Algorithm for Distributed Shortest Paths |
CNSR
2010
IEEE
13 years 11 months ago
2010
IEEE
—MANET routing protocols are designed to scale up to thousands of routers with frequent changes of the topology. In preference, MANET routing protocols should also support constr...
COCOON
2001
Springer
13 years 12 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
WEA
2009
Springer
14 years 2 months ago
2009
Springer
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...
PVLDB
2010
13 years 5 months ago
2010
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...
SODA
2004
ACM
13 years 8 months ago
2004
ACM