The weighted independent domination problem is NP-complete for chordal graphs (Q1887072)
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: The weighted independent domination problem is NP-complete for chordal graphs |
scientific article; zbMATH DE number 2118355
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The weighted independent domination problem is NP-complete for chordal graphs |
scientific article; zbMATH DE number 2118355 |
Statements
The weighted independent domination problem is NP-complete for chordal graphs (English)
0 references
23 November 2004
0 references
Chordal graph
0 references
Independent domination
0 references
NP-complete
0 references
Weight
0 references
