Recognizing well-dominated graphs is coNP-complete (Q6072202)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7749680
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8464300036430359
0 references
0.8337753415107727
0 references
0.8079038858413696
0 references
