Use of Floyd'S Algorithm to Find Shortest Restricted Paths

DOI10.1016/S0167-5060(08)70829-XzbMath0411.90071OpenAlexW1526051980MaRDI QIDQ4198356

Victor Klee, David G. Larman

Publication date: 1979

Published in: Discrete Optimization I, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70829-x

zbMATH Keywords

computational complexitynetwork programminggraph theoryshortest pathsFloyd's algorithmflow capacityNp- complete problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10) Directed graphs (digraphs), tournaments (05C20) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items

Dynamic programming and graph optimization problems