Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time.
Christian Wulff-NilsenPublished in: Comput. Geom. (2013)
Keyphrases
- preprocessing
- query processing
- disk resident
- efficient processing
- user queries
- feature extraction
- undirected graph
- query evaluation
- range queries
- web search engines
- query language
- edge weights
- real world graphs
- database
- query logs
- planar graphs
- reachability queries
- graph mining
- database queries
- graph matching
- directed graph
- euclidean distance
- distance function
- graph theory
- bipartite graph
- spanning tree
- complex queries
- distance measure
- response time
- data structure