A linear time algorithm for the next-to-shortest path problem on undirected graphs with nonnegative edge lengths
Bang Ye WuJun-Lin GuoYue-Li WangPublished in: CoRR (2012)
Keyphrases
- undirected graph
- shortest path problem
- directed graph
- directed acyclic graph
- disjoint paths
- single source
- interval data
- shortest path
- random walk
- approximation algorithms
- strongly connected
- spanning tree
- vertex set
- graph structure
- linear programming
- random graphs
- connected components
- objective function
- minimum cost
- random variables
- combinatorial optimization problems
- special case
- complex networks
- bayesian networks