A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem.
Tadao TakaokaPublished in: Inf. Process. Lett. (1992)
Keyphrases
- shortest path problem
- upper bound
- worst case
- shortest path
- lower bound
- single source
- interval data
- combinatorial optimization problems
- branch and bound algorithm
- multiple objectives
- directed graph
- directed acyclic graph
- space complexity
- pairwise
- bi objective
- branch and bound
- lower and upper bounds
- computational cost
- computational complexity