Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537)
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: Exploiting c-Closure in Kernelization Algorithms for Graph Problems |
scientific article; zbMATH DE number 7651204
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exploiting c-Closure in Kernelization Algorithms for Graph Problems |
scientific article; zbMATH DE number 7651204 |
Statements
7 February 2023
0 references
fixed-parameter tractability
0 references
kernelization
0 references
\(c\)-closure
0 references
dominating set
0 references
induced matching
0 references
irredundant set
0 references
Ramsey numbers
0 references
Exploiting c-Closure in Kernelization Algorithms for Graph Problems (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9071893
0 references
0.90366083
0 references
0.8983062
0 references
0.8962307
0 references
0 references
0.8763545
0 references
0.87551165
0 references
0.87494767
0 references
0 references
