NP-completeness results for partitioning a graph into total dominating sets (Q5920155)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: NP-completeness results for partitioning a graph into total dominating sets |
scientific article; zbMATH DE number 6796736
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP-completeness results for partitioning a graph into total dominating sets |
scientific article; zbMATH DE number 6796736 |
Statements
NP-completeness results for partitioning a graph into total dominating sets (English)
0 references
23 October 2017
0 references
0.9999999
0 references
0 references
0.92975175
0 references
0 references
0.9165721
0 references
0.91142434
0 references
0.9096331
0 references
