More results on weighted independent domination
Discrete Mathematics
2017-05-23 v2
Abstract
Weighted independent domination is an NP-hard graph problem, which remains computationally intractable in many restricted graph classes. In particular, the problem is NP-hard in the classes of sat-graphs and chordal graphs. We strengthen these results by showing that the problem is NP-hard in a proper subclass of the intersection of sat-graphs and chordal graphs. On the other hand, we identify two new classes of graphs where the problem admits polynomial-time solutions.
Cite
@article{arxiv.1602.09124,
title = {More results on weighted independent domination},
author = {Vadim Lozin and Dmitriy Malyshev and Raffaele Mosca and Viktor Zamaraev},
journal= {arXiv preprint arXiv:1602.09124},
year = {2017}
}