Lessons from the congested clique applied to MapReduce (Q896148)
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: Lessons from the congested clique applied to MapReduce |
scientific article; zbMATH DE number 6520537
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lessons from the congested clique applied to MapReduce |
scientific article; zbMATH DE number 6520537 |
Statements
Lessons from the congested clique applied to MapReduce (English)
0 references
11 December 2015
0 references
congested clique
0 references
distributed algorithms
0 references
graph coloring
0 references
MapReduce
0 references
0 references
0 references
0.989295780658722
0 references
0.7713058590888977
0 references
0.748673677444458
0 references
0.7463987469673157
0 references
