Finding \(K\) shortest looping paths in a traffic-light network (Q1886860)
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 \(K\) shortest looping paths in a traffic-light network |
scientific article; zbMATH DE number 2116904
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding \(K\) shortest looping paths in a traffic-light network |
scientific article; zbMATH DE number 2116904 |
Statements
Finding \(K\) shortest looping paths in a traffic-light network (English)
0 references
19 November 2004
0 references
Shortest path
0 references
Traffic-light
0 references
Looping path
0 references
0 references
0.9348749
0 references
0 references
0.8903217
0 references
0.8886795
0 references
0.8879951
0 references
0.88481504
0 references
0 references
0.8796486
0 references
