866 search results - page 10 / 174 » On Dynamic Shortest Paths Problems |
COCOON
1999
Springer
13 years 11 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
ALGORITHMICA
1998
13 years 7 months ago
1998
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...
LCN
1999
IEEE
13 years 11 months ago
1999
IEEE
This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the b...
VLDB
2007
ACM
14 years 7 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
DAM
2000
13 years 7 months ago
2000
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to