Sciweavers

Share
31 search results - page 1 / 7
» Exact Shortest Path Queries for Planar Graphs Using Linear S...
Sort
View
CORR
2010
Springer
105views Education» more  CORR 2010»
9 years 3 months ago
Exact Shortest Path Queries for Planar Graphs Using Linear Space
We provide the first linear-space data structure with provable sublinear query time for exact point-topoint shortest path queries in planar graphs. We prove that for any planar gr...
Shay Mozes, Christian Sommer
ISAAC
2005
Springer
118views Algorithms» more  ISAAC 2005»
9 years 9 months ago
External Data Structures for Shortest Path Queries on Planar Digraphs
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...
Lars Arge, Laura Toma
ESA
2005
Springer
155views Algorithms» more  ESA 2005»
9 years 9 months ago
Highway Hierarchies Hasten Exact Shortest Path Queries
We present a new speedup technique for route planning that exploits the hierarchy inherent in real world road networks. Our algorithm preprocesses the eight digit number of nodes n...
Peter Sanders, Dominik Schultes
COCOON
1999
Springer
9 years 8 months ago
An External Memory Data Structure for Shortest Path Queries
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
David A. Hutchinson, Anil Maheshwari, Norbert Zeh
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
10 years 5 months ago
Efficient Query Processing in Large Traffic Networks
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
books