Exact capacitated domination: on the computational complexity of uniqueness (Q2696625)
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: Exact capacitated domination: on the computational complexity of uniqueness |
scientific article; zbMATH DE number 7675087
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact capacitated domination: on the computational complexity of uniqueness |
scientific article; zbMATH DE number 7675087 |
Statements
Exact capacitated domination: on the computational complexity of uniqueness (English)
0 references
17 April 2023
0 references
exact capacitated domination
0 references
Nash subgraph
0 references
D-set
0 references
