Algorithm 562: Shortest Path Lengths [H]

DOI10.1145/355900.355919MaRDI QIDQ3885210zbMATH OpenOpenAlexFDO

Authors U. Pape

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

zbMATH Keywords

shortest path lengths

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Paths and cycles (05C38) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(7)

• Algorithms for finding k-best perfect matchings
• Parallel algorithms for the single source shortest path problem
• Shortest path algorithms: A computational study with the C programming language
• Studying the effects of production loss due to setup in dynamic production scheduling
• A Lagrangean decomposition solution to a single line multiproduct scheduling problem
• Solving the nearly symmetric all-pairs shortest-path problem
• Calendarization of time planning in MPM networks

This page was built for publication: Algorithm 562: Shortest Path Lengths [H]

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3885210)