The weighted independent domination problem is NP-complete for chordal graphs (Q1887072): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q400523 |
Changed an Item |
||
Property / author | |||
Property / author: Gerard Jennhwa Chang / rank | |||
Normal rank |
Revision as of 10:27, 14 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The weighted independent domination problem is NP-complete for chordal graphs |
scientific article |
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