Exact capacitated domination: on the computational complexity of uniqueness
From MaRDI portal
Publication:2696625
DOI10.1016/j.dam.2023.02.007OpenAlexW4323310119MaRDI QIDQ2696625
Philip R. Neary, Anders Yeo, Gregory Gutin
Publication date: 17 April 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.02.007
Games involving graphs (91A43) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Public goods in networks
- Clustering and domination in perfect graphs
- Independent domination in graphs: A survey and recent results
- Capacitated domination faster than \(O(2^n)\)
- Uniqueness of \(DP\)-Nash subgraphs and \(D\)-sets in weighted graphs of Netflix games
- Capacitated domination: problem complexity and approximation algorithms
- Non-cooperative games
- Network Games
- Equilibrium points in n -person games
- On the complexity of \(k\)-SAT
This page was built for publication: Exact capacitated domination: on the computational complexity of uniqueness
