25 search results - page 2 / 5 » Finding time-dependent shortest paths over large graphs |
ISVC
2009
Springer
14 years 25 days ago
2009
Springer
Throughout history, the primary means of transportation for humans has been on foot. We present a software tool which can help visualize and predict where historical trails might l...
JALC
2002
13 years 6 months ago
2002
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
JDA
2006
13 years 6 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
WINE
2010
Springer
13 years 4 months ago
2010
Springer
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...
FCCM
2006
IEEE
14 years 10 days ago
2006
IEEE
Field-Programmable Gate Arrays (FPGAs) are being employed in high performance computing systems owing to their potential to accelerate a wide variety of long-running routines. Par...