Detecting cliques in CONGEST networks (Q2220401)
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 7300288
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Detecting cliques in CONGEST networks |
scientific article; zbMATH DE number 7300288 |
Statements
Detecting cliques in CONGEST networks (English)
0 references
22 January 2021
0 references
CONGEST model
0 references
subgraph detection
0 references
lower bounds
0 references
two-party communication
0 references
set-disjointness
0 references
0 references
0.9980374574661256
0 references
0.830966591835022
0 references
0.8163270950317383
0 references
0.815511167049408
0 references
0.791247546672821
0 references
