Marking Shortest Paths On Pushdown Graphs Does Not Preserve MSO Decidability.
Arnaud CarayolOlivier SerrePublished in: CoRR (2015)
Keyphrases
- shortest path
- finding the shortest path
- weighted graph
- strongly connected components
- shortest path problem
- edge weights
- graph search
- shortest path algorithm
- road network
- finite state
- query answering
- betweenness centrality
- dynamic programming
- optimal path
- directed graph
- path length
- model checking
- flow graph
- minimal surface
- travel time
- minimum length
- graph partitioning
- random walk
- undirected graph
- minimum cost flow
- graph model