Spanning Trees and Shortest Paths in Monge Graphs.
Tibor DudásRüdiger RudolfPublished in: Computing (1998)
Keyphrases
- spanning tree
- shortest path
- weighted graph
- minimum spanning tree
- edge weights
- minimum spanning trees
- finding the shortest path
- shortest path problem
- edge disjoint
- shortest path algorithm
- minimum cost
- undirected graph
- road network
- graph partitioning
- minimum cost flow
- path length
- graph model
- shortest distance
- geodesic distance
- strongly connected components
- travel time
- np hard
- minimal surface
- flow graph