Finding the \(k\) quickest simple paths in a network (Q1322119): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(94)00008-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2052497422 / rank | |||
Normal rank | |||
Revision as of 23:52, 19 March 2024
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
