Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: new algorithms and experiments (Q2828206)
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: Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: new algorithms and experiments |
scientific article; zbMATH DE number 6642905
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: new algorithms and experiments |
scientific article; zbMATH DE number 6642905 |
Statements
24 October 2016
0 references
shortest-path tree
0 references
batch algorithms
0 references
dynamic networks
0 references
0 references
0 references
0.9542926
0 references
0 references
0.8940433
0 references
0 references
Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: new algorithms and experiments (English)
0 references
