Hardness of r-dominating set on Graphs of Diameter (r + 1).

Daniel Lokshtanov Neeldhara Misra Geevarghese Philip M. S. Ramanujan Saket Saurabh

Published in: IPEC (2013)

Keyphrases

dominating set
connected dominating set
facility location problem
approximation algorithms
graph theoretic
neural network
decision making
computational complexity
np complete
graph matching
np hard
phase transition
graph theory
facility location