25 search results - page 1 / 5 » Finding time-dependent shortest paths over large graphs |
EDBT
2008
ACM
14 years 5 months ago
2008
ACM
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
CIKM
2010
Springer
13 years 3 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
VLDB
2012
ACM
12 years 12 days ago
2012
ACM
The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest path query, reachability verification, and pattern ...
TKDE
2002
13 years 4 months ago
2002
In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to the minimum cost route computation. The HiTi graph model p...
ALENEX
2010
13 years 6 months ago
2010
We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy...