A decomposition algorithm for shortest paths in a network with many strongly connected components.
Peter BruckerPublished in: Z. Oper. Research (1974)
Keyphrases
- strongly connected components
- shortest path
- decomposition algorithm
- shortest path algorithm
- path length
- spatial networks
- finding the shortest path
- optimal path
- connected components
- road network
- argumentation semantics
- decomposition method
- network structure
- max sat
- working set
- travel time
- optimization problems
- variable ordering
- level set