Building large \(k\)-cores from sparse graphs (Q5089202)
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: Building large k-cores from sparse graphs |
scientific article; zbMATH DE number 7559406
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Building large \(k\)-cores from sparse graphs |
scientific article; zbMATH DE number 7559406 |
Statements
18 July 2022
0 references
parameterized complexity
0 references
\(k\)-core
0 references
vertex cover
0 references
treewidth
0 references
0 references
0.9218109846115112
0 references
0.8972644209861755
0 references
0.7950614094734192
0 references
0.7906595468521118
0 references
0.7854806184768677
0 references
