Why Is Maximum Clique Often Easy in Practice? (Q5144801)
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: Why Is Maximum Clique Often Easy in Practice? |
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
