Further exploiting \(c\)-closure for FPT algorithms and kernels for domination problems (Q6490985)
From MaRDI portal
scientific article; zbMATH DE number 7836606
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Further exploiting \(c\)-closure for FPT algorithms and kernels for domination problems |
scientific article; zbMATH DE number 7836606 |
Statements
Further exploiting \(c\)-closure for FPT algorithms and kernels for domination problems (English)
0 references
23 April 2024
0 references
\(c\)-closed graphs
0 references
domination problems
0 references
perfect code
0 references
connected dominating set
0 references
fixed-parameter tractable
0 references
polynomial kernel
0 references
