Approximation of distances and shortest paths in the broadcast congest clique (Q5363797)
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: Approximation of distances and shortest paths in the broadcast congest clique |
scientific article; zbMATH DE number 6784993
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation of distances and shortest paths in the broadcast congest clique |
scientific article; zbMATH DE number 6784993 |
Statements
29 September 2017
0 references
distributed computing
0 references
distributed algorithms
0 references
approximation algorithms
0 references
0.8955979347229004
0 references
0.8418124318122864
0 references
0.8383153676986694
0 references
0.8285889029502869
0 references
0.8272647857666016
0 references
