On the complexity of the identifiable subgraph problem, revisited

Stefan Kratsch, Martin Milanič

A bipartite graph $G=(L,R;E)$ with at least one edge is said to be identifiable if for every vertex $v\in L$, the subgraph induced by its non-neighbors has a matching of cardinalit…