On the computational complexity of upper total domination (Q1421481)
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: On the computational complexity of upper total domination |
scientific article; zbMATH DE number 2032825
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of upper total domination |
scientific article; zbMATH DE number 2032825 |
Statements
On the computational complexity of upper total domination (English)
0 references
26 January 2004
0 references
Upper total domination
0 references
Upper fractional total domination
0 references
Linear programming
0 references
NP-complete
0 references
