Time-dependent shortest paths in bounded treewidth graphs.
Glencora BorradaileMorgan ShirleyPublished in: CoRR (2017)
Keyphrases
- bounded treewidth
- shortest path
- travel time
- np complete
- finding the shortest path
- road network
- shortest path algorithm
- decision problems
- weighted graph
- conjunctive queries
- boolean functions
- path length
- spatial networks
- relational learning
- databases
- geodesic distance
- minimum cost flow
- dynamic programming
- np hard
- computational complexity
- machine learning
- flow graph
- betweenness centrality
- strongly connected components
- database
- monadic datalog
- phase transition
- query answering
- query evaluation
- probability distribution
- database systems