The Sparsest Additive Spanner via Multiple Weighted BFS Trees (Q5091078): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
The Sparsest Additive Spanner via Multiple Weighted BFS Trees | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://dblp.uni-trier.de/db/journals/corr/corr1811.html#abs-1811-01997 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2899983391 / rank | |||
Normal rank | |||
| Property / title | |||
The Sparsest Additive Spanner via Multiple Weighted BFS Trees (English) | |||
| Property / title: The Sparsest Additive Spanner via Multiple Weighted BFS Trees (English) / rank | |||
Normal rank | |||
Latest revision as of 10:59, 30 July 2024
scientific article; zbMATH DE number 7561435
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Sparsest Additive Spanner via Multiple Weighted BFS Trees |
scientific article; zbMATH DE number 7561435 |
Statements
21 July 2022
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
The Sparsest Additive Spanner via Multiple Weighted BFS Trees (English)
0 references
