Pairwise edge disjoint shortest paths in the n-cube.
Teofilo F. GonzalezDavid SerenaPublished in: Theor. Comput. Sci. (2006)
Keyphrases
- shortest path
- edge disjoint
- pairwise
- spanning tree
- total length
- weighted graph
- shortest path algorithm
- shortest path problem
- road network
- multi dimensional
- similarity measure
- travel time
- markov random field
- semi supervised
- path length
- minimum cost
- spectral clustering
- point sets
- minimum cost flow
- shortest distance
- edge weights
- image sequences