Parameterized Complexity of Minimum Membership Dominating Set

Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy +2

Given a graph $G=(V,E)$ and an integer $k$, the Minimum Membership Dominating Set (MMDS) problem seeks to find a dominating set $S\subseteq V$ of $G$ such that for each $v\in V$,…