Exact capacitated domination: on the computational complexity of uniqueness

DOI10.1016/J.DAM.2023.02.007zbMath1511.05179arXiv2003.07106MaRDI QIDQ6336822

Anders Yeo, Gregory Gutin, Philip R. Neary

Publication date: 16 March 2020

Mathematics Subject Classification ID

Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57)

This page was built for publication: Exact capacitated domination: on the computational complexity of uniqueness