Fully dynamic randomized algorithms for graph spanners (Q3189078)
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 6341947
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fully dynamic randomized algorithms for graph spanners |
scientific article; zbMATH DE number 6341947 |
Statements
Fully dynamic randomized algorithms for graph spanners (English)
0 references
9 September 2014
0 references
graph algorithms
0 references
approximate shortest paths
0 references
dynamic algorithm
0 references
graph spanner
0 references
0 references
0.9140247
0 references
0.9089347
0 references
0.90196055
0 references
0.8962401
0 references
0.8959334
0 references
0.88988525
0 references
