Shortcut in the Decomposition Algorithm for Shortest Paths in a Network
From MaRDI portal
Publication:5590541
DOI10.1147/rd.134.0387zbMath0194.50801OpenAlexW2149220137MaRDI QIDQ5590541
No author found.
Publication date: 1969
Published in: IBM Journal of Research and Development (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1147/rd.134.0387
Related Items (5)
A very personal reminiscence on the problem of computational complexity ⋮ Some problems in discrete optimization ⋮ Shortest path and closure algorithms for banded matrices ⋮ Shortest-path queries in static networks ⋮ A decomposition algorithm for optimality problems in tree-structured networks
This page was built for publication: Shortcut in the Decomposition Algorithm for Shortest Paths in a Network
