On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph.
Nili Guttmann-BeckRefael HassinPublished in: Discret. Optim. (2011)
Keyphrases
- shortest path
- finding the shortest path
- weighted graph
- shortest path problem
- flow graph
- path length
- edge weights
- graph search
- strongly connected components
- minimum cut
- betweenness centrality
- road network
- random walk
- shortest path algorithm
- optimal path
- graph theory
- graph structure
- connected components
- dynamic programming
- shortest distance
- spatial networks
- geodesic distance
- graph model
- multi objective
- travel time
- information flow