Finding the \(k\) quickest simple paths in a network (Q1322119): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An algorithm for finding the \(k\) quickest paths in a network / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The quickest path problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Shortest-path algorithms: Taxonomy and annotation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An efficient algorithm for K shortest simple paths / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for the quickest path problem and the enumeration of quickest paths / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding the <i>K</i> Shortest Loopless Paths in a Network / rank | |||
Normal rank | |||
Latest revision as of 15:31, 22 May 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
