Abstract
Let G be a graph. The independence-domination number γi (G) is the maximum over all independent sets I in G of the minimal number of vertices needed to dominate I. In this paper we investigate the computational complexity of γi (G) for graphs in several graph classes related to cographs. We present an exact exponential algorithm. We show that there is a polynomial-time algorithm to compute a maximum independent set in the Cartesian product of two cographs. We prove that independence domination is NP-hard for planar graphs and we present a PTAS. © 2013 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Hon, W. K., Kloks, T., Liu, H. H., Poon, S. H., & Wang, Y. L. (2013). On independence domination. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8070 LNCS, pp. 183–194). https://doi.org/10.1007/978-3-642-40164-0_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
