Sciweavers

COCOON
1999
Springer
14 years 3 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
ISAAC
2004
Springer
121views Algorithms» more  ISAAC 2004»
14 years 4 months ago
Approximate Distance Oracles for Graphs with Dense Clusters
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...
Mattias Andersson, Joachim Gudmundsson, Christos L...
ISAAC
2005
Springer
118views Algorithms» more  ISAAC 2005»
14 years 4 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
ICCSA
2007
Springer
14 years 5 months ago
Shortest Path Queries Between Geometric Objects on Surfaces
Abstract. We consider geometric shortest path queries between arbitrary pairs of objects on a connected polyhedral surface P of genus g. The query objects are points, vertices, edg...
Hua Guo, Anil Maheshwari, Doron Nussbaum, Jör...
ALT
2007
Springer
14 years 7 months ago
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
Lev Reyzin, Nikhil Srivastava
ICDE
2010
IEEE
247views Database» more  ICDE 2010»
14 years 10 months ago
Efficient Verification of Shortest Path Search via Authenticated Hints
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...
Man Lung Yiu, Yimin Lin, Kyriakos Mouratidis
VLDB
2007
ACM
114views Database» more  VLDB 2007»
14 years 11 months ago
Optimization and evaluation of shortest path queries
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
Edward P. F. Chan, Heechul Lim