COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS (Q5696908)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2216281
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.822115421295166
0 references
0.779926061630249
0 references
0.7552571892738342
0 references
0.7548617720603943
0 references
0.748062014579773
0 references
