On the kernel size of clique cover reductions for random intersection graphs (Q491163): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jda.2015.05.014 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JDA.2015.05.014 / rank | |||
Normal rank | |||
Latest revision as of 19:16, 9 December 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
