New bounds for the CLIQUE-GAP problem using graph decomposition theory (Q1709587)
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: New bounds for the CLIQUE-GAP problem using graph decomposition theory |
scientific article; zbMATH DE number 6856554
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New bounds for the CLIQUE-GAP problem using graph decomposition theory |
scientific article; zbMATH DE number 6856554 |
Statements
New bounds for the CLIQUE-GAP problem using graph decomposition theory (English)
0 references
6 April 2018
0 references
communication complexity
0 references
clique
0 references
streaming algorithm
0 references
graph decomposition
0 references
triangle counting
0 references
