Algorithmic techniques for maintaining shortest routes in dynamic networks (Q2864176)
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 6236134
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic techniques for maintaining shortest routes in dynamic networks |
scientific article; zbMATH DE number 6236134 |
Statements
6 December 2013
0 references
dynamic networks
0 references
dynamic graph problems
0 references
dynamic shortest paths
0 references
Algorithmic techniques for maintaining shortest routes in dynamic networks (English)
0 references
0.8574953675270081
0 references
0.8461734652519226
0 references
0.8242349028587341
0 references
0.7831017374992371
0 references
0.7792532444000244
0 references
