Decrementai Transitive Closure and Shortest Paths for Planar Digraphs and Beyond.
Adam KarczmarzPublished in: SODA (2018)
Keyphrases
- transitive closure
- shortest path
- expressive power
- query evaluation
- shortest path algorithm
- constraint databases
- first order logic
- directed acyclic graph
- path length
- recursive queries
- road network
- flow graph
- spatial databases
- relational algebra
- query language
- finding the shortest path
- directed graph
- travel time
- labeling scheme
- geodesic distance
- query containment
- undirected graph
- spatial networks
- data management
- strongly connected components
- database