Why Is Maximum Clique Often Easy in Practice? (Q5144801): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: BBMCW / rank | |||
Normal rank | |||
Revision as of 22:55, 28 February 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
