42 search results - page 3 / 9 » TEDI: efficient shortest path query answering on graphs |
TKDE
2002
13 years 6 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...
ISAAC
2004
Springer
13 years 11 months ago
2004
Springer
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...
ICDE
2010
IEEE
14 years 6 months ago
2010
IEEE
Shortest path search in transportation networks is unarguably one of the most important online search services nowadays (e.g., Google Maps, MapQuest, etc), with applications spanni...
CIKM
2010
Springer
13 years 5 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...
ISAAC
2010
Springer
13 years 4 months ago
2010
Springer
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...