Computational Problem on Bipartite graphs

36 Views Asked by At

Given a bipartite graph $G$ with vertex classes $A$ and $B$ and a constant $k \in \mathbb{N}$ with $k<|A|$ is the problem of finding ALL (not just verifying the existence of) subsets $S \subseteq A$ such that $|N(S)|=|S|-k$ solvable in polynomial time?