New Results on Weighted Independent Domination
Weighted independent domination is an NP-hard graph problem, which remains computationally intractable in many restricted graph classes. Only few examples of classes are available, where the problem admits polynomial-time solutions. In the present paper, we extend the short list of such classes with two new examples.
The results of Sect. 3 were obtained under financial support of the Russian Science Foundation grant No. 17-11-01336. The results of Sect. 4 were obtained under financial support of the Russian Foundation for Basic Research, grant No. 16-31-60008-mol-a-dk, RF President grant MK-4819.2016.1 and LATNA laboratory, National Research University Higher School of Economics.
- 9.Lokshantov, D., Vatshelle, M., Villanger, Y.: Independent set in \(P_5\)-free graphs in polynomial time. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 570–581 (2014)Google Scholar