Detecting cliques in CONGEST networks (Q5090906)
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 7561268
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Detecting cliques in CONGEST networks |
scientific article; zbMATH DE number 7561268 |
Statements
21 July 2022
0 references
lower bounds
0 references
CONGEST
0 references
subgraph detection
0 references
two-party communication
0 references
0 references
0.9980374574661256
0 references
0.8331291079521179
0 references
0.8198344111442566
0 references
0.8180510401725769
0 references
0.7918028831481934
0 references
