The parameterized complexity of the \(k\)-biclique problem (Q4625655)
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 7029219
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The parameterized complexity of the \(k\)-biclique problem |
scientific article; zbMATH DE number 7029219 |
Statements
The Parameterized Complexity of the <i>k</i> -Biclique Problem (English)
0 references
25 February 2019
0 references
biclique
0 references
exponential time hypothesis
0 references
maximum \(k\)-subset intersection
0 references
Weil's character sum theorem
0 references
dichotomy theorem
0 references
parameterized inapproximability
0 references
probabilistic method
0 references
0.957904815673828
0 references
0.8493868708610535
0 references
0.8346389532089233
0 references
0.829670250415802
0 references
0.8046720027923584
0 references
