173 search results - page 2 / 35 » The Fastest and Shortest Algorithm for All Well-Defined Prob... |
252
click to vote
ICDE
2006
IEEE
16 years 4 months ago
2006
IEEE
This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time interval I, a source node s and an end node e, allFP ...
138
Voted
SIAMCOMP
2010
14 years 10 months ago
2010
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
113
click to vote
STOC
2003
ACM
16 years 3 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...
145
click to vote
ISAAC
2003
Springer
15 years 8 months ago
2003
Springer
We consider all-optical networks with shortest-path routing that use wavelength-division multiplexing and employ wavelength conversion at specific nodes in order to maximize their...
103
Voted
STACS
2010
Springer
15 years 10 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...