Computing the N Best Loopless Paths in a Network

DOI10.1137/0111081MaRDI QIDQ5621322zbMATH OpenOpenAlexFDO

Authors

Publication date 1964

Published in Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0111081

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Cited in

(4)

• An algorithm for ranking paths in acyclic networks
• Finding the \(k\) shortest simple paths: time and space trade-offs
• K-shortest simple paths using biobjective path search
• k-shortest simple paths in bounded treewidth graphs

This page was built for publication: Computing the N Best Loopless Paths in a Network

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