- 博客(1)
- 资源 (1)
- 收藏
- 关注
原创 codeforces 688c 二分图判断
Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex cover problem very interesting. Suppose the graph G is given. Subset A of its vertices is called
2016-07-01 14:51:51 1011
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人