Finding Shortest Paths Between Graph Colourings.
Matthew JohnsonDieter KratschStefan KratschViresh PatelDaniël PaulusmaPublished in: Algorithmica (2016)
Keyphrases
- shortest path
- weighted graph
- flow graph
- finding the shortest path
- shortest path problem
- path length
- edge weights
- strongly connected components
- graph search
- betweenness centrality
- shortest path algorithm
- minimum cut
- road network
- random walk
- travel time
- graph model
- minimal surface
- directed graph
- spanning tree
- min cut
- minimum cost flow
- shortest distance
- social networks
- maximum flow
- information flow
- dynamic programming
- graph theory
- reinforcement learning