Finding \(K\) shortest looping paths in a traffic-light network (Q1886860): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 06:07, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding \(K\) shortest looping paths in a traffic-light network |
scientific article |
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
