The first <i>K</i> minimum cost paths in a time-schedule network (Q4658384)
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: The first K minimum cost paths in a time-schedule network |
scientific article; zbMATH DE number 2146663
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The first <i>K</i> minimum cost paths in a time-schedule network |
scientific article; zbMATH DE number 2146663 |
Statements
The first <i>K</i> minimum cost paths in a time-schedule network (English)
0 references
16 March 2005
0 references
shortest path
0 references
road transport
0 references
networks and graphs
0 references
