Sciweavers

Share
22 search results - page 1 / 5
» Multiple-Source Shortest Paths in Embedded Graphs
Sort
View
CORR
2012
Springer
195views Education» more  CORR 2012»
8 years 6 months ago
Multiple-Source Shortest Paths in Embedded Graphs
Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let f be an arbitrary face of G. We describe an alg...
Sergio Cabello, Erin W. Chambers, Jeff Erickson
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
10 years 11 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...
VLDB
2012
ACM
361views Database» more  VLDB 2012»
8 years 6 months ago
Answering pattern match queries in large graph databases via graph embedding
The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest path query, reachability veriļ¬cation, and pattern ...
Lei Zou, Lei Chen 0002, M. Tamer Özsu, Dongya...
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
9 years 5 months ago
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
Timothy M. Chan
COCOON
1999
Springer
10 years 2 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
books