Perfectly Matched Sets in Graphs: Parameterized and Exact Computation

N. R. Aravind, Roopam Saxena

In an undirected graph $G=(V,E)$, we say $(A,B)$ is a pair of perfectly matched sets if $A$ and $B$ are disjoint subsets of $V$ and every vertex in $A$ (resp. $B$) has exactly one…