On the kernel size of clique cover reductions for random intersection graphs (Q491163)
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: On the kernel size of clique cover reductions for random intersection graphs |
scientific article; zbMATH DE number 6475114
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the kernel size of clique cover reductions for random intersection graphs |
scientific article; zbMATH DE number 6475114 |
Statements
On the kernel size of clique cover reductions for random intersection graphs (English)
0 references
24 August 2015
0 references
parameterized algorithms
0 references
clique cover
0 references
kernelization
0 references
average case
0 references
random intersection graphs
0 references
Erdős-Rényi graphs
0 references
0.7621617317199707
0 references
0.7608498930931091
0 references
0.749591588973999
0 references
0.7399865388870239
0 references
0.7369493842124939
0 references
