codeforces 688c 二分图判断
Recently, Pari and Arya did some research about NP-Hard problems and they found theminimum vertex cover problem very interesting.Suppose the graph G is given. Subset A of its vertices is called
