The weighted independent domination problem is NP-complete for chordal graphs (Q1887072): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4247463 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Weighted domination of cocomparability graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Independent domination in chordal graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4368728 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4368729 / rank | |||
Normal rank |
Latest revision as of 16:21, 7 June 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