More results on weighted independent domination

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 prop...

Full description

Saved in:
Bibliographic Details
Main Authors Lozin, Vadim, Malyshev, Dmitriy, Mosca, Raffaele, Zamaraev, Viktor
Format Journal Article
LanguageEnglish
Published 29.02.2016
Subjects
Computer Science - Discrete Mathematics
Online AccessGet full text

Cover

More Information
Summary: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.
DOI:10.48550/arxiv.1602.09124