Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs (Q411223)
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 6021862
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs |
scientific article; zbMATH DE number 6021862 |
Statements
Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs (English)
0 references
4 April 2012
0 references
chordal graphs
0 references
dominating set
0 references
independent dominating set
0 references
parameterized complexity
0 references
0.8518648743629456
0 references
0.7886428833007812
0 references
0.7804142832756042
0 references
0.7785479426383972
0 references
0.7785077691078186
0 references
