The weighted independent domination problem is NP-complete for chordal graphs (Q1887072): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2003.05.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2015322736 / rank | |||
Normal rank | |||
Revision as of 01:55, 20 March 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
