The sparsest additive spanner via multiple weighted BFS trees (Q2201997)
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: The sparsest additive spanner via multiple weighted BFS trees |
scientific article; zbMATH DE number 7248834
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The sparsest additive spanner via multiple weighted BFS trees |
scientific article; zbMATH DE number 7248834 |
Statements
The sparsest additive spanner via multiple weighted BFS trees (English)
0 references
17 September 2020
0 references
distributed graph algorithms
0 references
congest model
0 references
weighted BFS trees
0 references
additive spanners
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.825511634349823
0 references
0.8238049745559692
0 references
0.8209143877029419
0 references
0.814844012260437
0 references
0.8143314719200134
0 references
