313 search results - page 3 / 63 » Shortest Paths in Distance-regular Graphs |
ESA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
ESA
2004
Springer
14 years 26 days ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We study problems of reconguration of shortest paths in graphs. We prove that the shortest reconguration sequence can be exponential in the size of the graph and that it is NP-hard...