Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Computing the N Best Loopless Paths in a Network - MaRDI portal

Computing the N Best Loopless Paths in a Network

From MaRDI portal

Publication:5621322

Jump to:navigation, search

DOI10.1137/0111081zbMATH Open0217.29003OpenAlexW2010945917MaRDI QIDQ5621322

No author found.

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

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

Related Items (2)

Finding the \(k\) shortest simple paths: time and space trade-offs ⋮ An algorithm for ranking paths in acyclic networks

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5621322&oldid=30285924"