Recognizing well-dominated graphs is coNP-complete (Q6072202): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2023.106419 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2023.106419 / rank | |||
Normal rank | |||
Latest revision as of 18:10, 30 December 2024
scientific article; zbMATH DE number 7749680
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recognizing well-dominated graphs is coNP-complete |
scientific article; zbMATH DE number 7749680 |
Statements
Recognizing well-dominated graphs is coNP-complete (English)
0 references
12 October 2023
0 references
well-dominated
0 references
well-totally-dominated
0 references
recognition
0 references
coNP-complete
0 references
computational complexity
0 references
0 references
0 references
