FPT algorithms for domination in sparse graphs and beyond (Q1740694)
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: FPT algorithms for domination in sparse graphs and beyond |
scientific article; zbMATH DE number 7050146
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | FPT algorithms for domination in sparse graphs and beyond |
scientific article; zbMATH DE number 7050146 |
Statements
FPT algorithms for domination in sparse graphs and beyond (English)
0 references
2 May 2019
0 references
domination
0 references
parameterized algorithm
0 references
biclique-free graphs
0 references
0 references
0 references
0 references
0.9367825388908386
0 references
0.8424312472343445
0 references
0.8155433535575867
0 references
0.8060470223426819
0 references
0.8043623566627502
0 references
