COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS (Q5696908): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q3619797 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3292914 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Shortest path with time constraints on movement and parking / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 17:47, 10 June 2024
scientific article; zbMATH DE number 2216281
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS |
scientific article; zbMATH DE number 2216281 |
Statements
COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS (English)
0 references
19 October 2005
0 references
dynamic networks
0 references
routing
0 references
evolving graphs
0 references
graph theoretical models
0 references
leo satellite networks
0 references
fixed-schedule dynamic networks
0 references
