Parameterized dominating set problem in chordal graphs: Complexity and lower bound (Q839675)
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 5601555
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized dominating set problem in chordal graphs: Complexity and lower bound |
scientific article; zbMATH DE number 5601555 |
Statements
Parameterized dominating set problem in chordal graphs: Complexity and lower bound (English)
0 references
2 September 2009
0 references
chordal graphs
0 references
dominating set
0 references
parameterized complexity
0 references
lower bound
0 references
interval graphs
0 references
0 references
0.8518648743629456
0 references
0.8309748768806458
0 references
0.8083146214485168
0 references
0.7895253896713257
0 references
