New Sharpness Properties, Algorithms and Complexity Bounds for Partitioning Shortest Path Procedures.

Fred W. Glover Darwin Klingman

Published in: Oper. Res. (1989)

Keyphrases

shortest path
complexity bounds
shortest path algorithm
strongly connected components
data structure
road network
shortest path problem
worst case
optimal path
computational complexity
relational databases
pattern matching
range queries
weighted graph
path length