Finding the \(k\) quickest simple paths in a network (Q1322119)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding the \(k\) quickest simple paths in a network |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the \(k\) quickest simple paths in a network |
scientific article |
Statements
Finding the \(k\) quickest simple paths in a network (English)
0 references
9 June 1994
0 references
combinatorial problems
0 references
design of algorithms
0 references
quickest path problem
0 references
routing path
0 references
