Why Is Maximum Clique Often Easy in Practice? (Q5144801): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1287/opre.2019.1970 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/OPRE.2019.1970 / rank | |||
Normal rank | |||
Latest revision as of 17:06, 30 December 2024
scientific article; zbMATH DE number 7298155
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Why Is Maximum Clique Often Easy in Practice? |
scientific article; zbMATH DE number 7298155 |
Statements
Why Is Maximum Clique Often Easy in Practice? (English)
0 references
19 January 2021
0 references
maximum clique
0 references
fixed-parameter tractable
0 references
fpt
0 references
vertex cover
0 references
degeneracy
0 references
\(k\)-core
0 references
parameterized below degeneracy
0 references
kernelization
0 references
parameterized complexity
0 references
0 references
0 references
0 references
0 references
