A Linear-Time Algorithm for the Maximum Matched-Paired-Domination Problem in Cographs

Ruo-Wei Hung, Chih-Chia Yao

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…