@article {IOPORT.05982501,
    author       = {Hung, Ruo-Wei and Yao, Chih-Chia},
    title        = {Linear-time algorithm for the matched-domination problem in cographs.},
    year         = {2011},
    journal      = {International Journal of Computer Mathematics},
    volume       = {88},
    number       = {10},
    issn         = {0020-7160},
    pages        = {2042-2056},
    publisher    = {Taylor \& Francis, Abingdon},
    doi          = {10.1080/00207160.2010.539681},
    abstract     = {Summary: Let $G=(V, E)$ be a graph without isolated vertices. A matching in $G$ is a set of independent edges in $G$. A perfect matching $M$ in $G$ is a matching such that every vertex of $G$ is incident to an edge of $M$. A set $S \subseteq V$ is a paired-dominating set of $G$ if every vertex not in $S$ is adjacent to a vertex in $S$ and if the subgraph induced by $S$ contains a perfect matching. The paired-domination problem is to find a paired-dominating set of $G$ with minimum cardinality. This paper introduces a generalization of the paired-domination problem, namely, the matched-domination problem, in which some constrained vertices are in paired-dominating sets as far as they can. Further, possible applications are also presented. We then present a linear-time constructive algorithm to solve the matched-domination problem in cographs.},
    identifier   = {05982501},
}