Abstract
The class of equistable graphs is defined by the existence of a cost structure on the vertices such that the maximal stable sets are characterized by their costs. This graph class, not contained in any nontrivial hereditary class, has so far been studied mostly from a structural point of view; characterizations and polynomial time recognition algorithms have been obtained for special cases.We focus on complexity issues for equistable graphs and related classes. We describe a simple pseudo-polynomial-time dynamic programming algorithm to solve the maximum weight stable set problem along with the weighted independent domination problem in some classes of graphs, including equistable graphs. Our results are obtained within the wider context of Boolean optimization; corresponding hardness results are also provided. More specifically, we show that the above problems are APX-hard for equistable graphs and that it is co-NP-complete to determine whether a given cost function on the vertices of a graph defines an equistable cost structure of that graph.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
