On computing sets of shortest paths in a graph

DOI10.1145/355616.364037zbMath0279.68034OpenAlexW2072016939MaRDI QIDQ4766035

Edward Minieka

Publication date: 1974

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/355616.364037

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (4)

Multiple space debris collecting mission -- debris selection and trajectory optimization ⋮ Flexible guidepath design for automated guided vehicle systems ⋮ Optimization realization of a distance matrix † ⋮ Finding the k Shortest Paths

This page was built for publication: On computing sets of shortest paths in a graph