Congested clique algorithms for graph spanners (Q5090933)
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 7561292
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Congested clique algorithms for graph spanners |
scientific article; zbMATH DE number 7561292 |
Statements
21 July 2022
0 references
distributed graph algorithms
0 references
spanner
0 references
congested clique
0 references
0 references
0 references
Congested Clique Algorithms for Graph Spanners (English)
0 references
0.8657304644584656
0 references
0.8455139398574829
0 references
0.8425196409225464
0 references
0.8397804498672485
0 references
0.8345159888267517
0 references
