On independence domination
Discrete Mathematics
2013-04-25 v1 Combinatorics
Abstract
Let G be a graph. The independence-domination number 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 independence domination for graphs in several graph classes related to cographs. We present an exact exponential algorithm. We also present a PTAS for planar graphs.
Cite
@article{arxiv.1304.6450,
title = {On independence domination},
author = {Wing-Kai Hon and Ton Kloks and Hsiang Hsuan Liu and Sheung-Hung Poon and Yue-Li Wang},
journal= {arXiv preprint arXiv:1304.6450},
year = {2013}
}