An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification (Q284360)
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 6581520
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification |
scientific article; zbMATH DE number 6581520 |
Statements
An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification (English)
0 references
18 May 2016
0 references
dominating set
0 references
fixed-parameter tractability
0 references
tree decomposition
0 references
computational complexity
0 references
0 references
0.7653892040252686
0 references
0.7402859926223755
0 references
0.7396465539932251
0 references
0.7341703772544861
0 references
0.7302575707435608
0 references
