Algorithm 562: Shortest Path Lengths [H]
From MaRDI portal
Publication:3885210
DOI10.1145/355900.355919zbMath0442.68063OpenAlexW2053723217MaRDI QIDQ3885210
Publication date: 1980
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/355900.355919
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (7)
Algorithms for finding k-best perfect matchings ⋮ A Lagrangean decomposition solution to a single line multiproduct scheduling problem ⋮ Calendarization of time planning in MPM networks ⋮ Parallel algorithms for the single source shortest path problem ⋮ Shortest path algorithms: A computational study with the C programming language ⋮ Solving the Nearly Symmetric All-Pairs Shortest-Path Problem ⋮ Studying the effects of production loss due to setup in dynamic production scheduling
This page was built for publication: Algorithm 562: Shortest Path Lengths [H]
