390 search results - page 9 / 78 » Computing shortest paths for any number of hops |
91
Voted
JUCS
2010
14 years 10 months ago
2010
: We prove that two conditions are sufficient, and with three exceptions also necessary, for reachability of any position in restricted walk on integers in which the sizes of the m...
124
click to vote
NETWORKS
2007
14 years 11 months ago
2007
Internet protocol (IP) traffic follows rules established by routing protocols. Shortest path based protocols, such as Open Shortest Path First (OSPF), direct traffic based on arc w...
82
Voted
STOC
2003
ACM
15 years 12 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ ) and S = O(N2...
COCOON
2001
Springer
15 years 4 months ago
2001
Springer
In an undirected, 2-node connected graph G = (V, E) with positive real edge lengths, the distance between any two nodes r and s is the length of a shortest path between r and s in ...