On the Complexity of Reinforcement in Graphs
Nader Jafari Rad (2016)
Discussiones Mathematicae Graph Theory
Similarity:
We show that the decision problem for p-reinforcement, p-total rein- forcement, total restrained reinforcement, and k-rainbow reinforcement are NP-hard for bipartite graphs.