Comment on a computing the k shortest paths in a graph

DOI10.1145/359763.359804MaRDI QIDQ4122793zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(2)

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

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

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