The distributed algorithm for constructing extremal graphs without hexagon (Q2815802)
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 distributed algorithm for constructing extremal graphs without hexagon |
scientific article; zbMATH DE number 6599951
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The distributed algorithm for constructing extremal graphs without hexagon |
scientific article; zbMATH DE number 6599951 |
Statements
30 June 2016
0 references
distributed computing
0 references
MapReduce
0 references
Hadoop
0 references
extremal graph
0 references
The distributed algorithm for constructing extremal graphs without hexagon (English)
0 references
0.7251169085502625
0 references
0.6965199708938599
0 references
0.6963287591934204
0 references
0.6951046586036682
0 references
