Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305)
From MaRDI portal
scientific article; zbMATH DE number 7617251
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems |
scientific article; zbMATH DE number 7617251 |
Statements
Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (English)
0 references
15 November 2022
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
0 references
0 references
0 references
0 references
0 references
