On the Parameterized Complexity of [1,j]-Domination Problems (Q5090974)
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 7561339
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Parameterized Complexity of [1,j]-Domination Problems |
scientific article; zbMATH DE number 7561339 |
Statements
21 July 2022
0 references
\([1,j]\)-dominating set
0 references
parameterized complexity
0 references
sparse graphs
0 references
0 references
0 references
On the Parameterized Complexity of [1,j]-Domination Problems (English)
0 references
0.9633287191390992
0 references
0.8292761445045471
0 references
0.8067780137062073
0 references
0.8049538731575012
0 references
0.7969923615455627
0 references
