Finding Shortest Paths Between Graph Colourings.
Matthew JohnsonDieter KratschStefan KratschViresh PatelDaniël PaulusmaPublished in: IPEC (2014)
Keyphrases
- shortest path
- weighted graph
- shortest path problem
- finding the shortest path
- flow graph
- path length
- edge weights
- strongly connected components
- betweenness centrality
- graph search
- minimum cut
- shortest path algorithm
- optimal path
- travel time
- random walk
- graph structure
- road network
- graph model
- graph theory
- complex networks
- minimal surface
- directed graph
- social networks
- geodesic distance
- minimum cost flow
- markov chain