On the kernel size of clique cover reductions for random intersection graphs (Q491163): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:08, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the kernel size of clique cover reductions for random intersection graphs |
scientific article |
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
