Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818)
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 7771536
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems |
scientific article; zbMATH DE number 7771536 |
Statements
Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (English)
0 references
29 November 2023
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
0 references
0 references
0 references
0 references
0 references
0 references
0.8571372628211975
0 references
0.783257782459259
0 references
0.781038224697113
0 references
