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 the normal view instead:
scientific article; zbMATH DE number 7298155
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.842171847820282
0 references
0.8217579126358032
0 references
0.7949277758598328
0 references
0.7911498546600342
0 references
