Comment on a computing the k shortest paths in a graph

DOI10.1145/359763.359804zbMath0352.68057OpenAlexW1995809477MaRDI QIDQ4122793

Eugene L. Lawler

Publication date: 1977

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

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

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Related Items (2)

Finding the k Shortest Paths ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems)

This page was built for publication: Comment on a computing the k shortest paths in a graph