Marking shortest paths on pushdown graphs does not preserve MSO decidability.
Arnaud CarayolOlivier SerrePublished in: Inf. Process. Lett. (2016)
Keyphrases
- shortest path
- finding the shortest path
- weighted graph
- shortest path problem
- shortest path algorithm
- graph search
- strongly connected components
- edge weights
- betweenness centrality
- finite state
- road network
- regular expressions
- model checking
- dynamic programming
- shortest distance
- geodesic distance
- query answering
- graph partitioning
- optimal path
- graph theory
- directed graph
- np hard
- spanning tree
- travel time
- graph structure
- flow graph
- query language