查看会员资料
用 户 名：Li***
发送消息- Email：用户隐藏
- Icq/MSN：
- 电话号码：
- Homepage：
- 会员简介：
最新会员发布资源
Ostergard_A-New-Algorithm-for-the-Maximum-Weight-
- Given a graph, in the maximum clique problem one wants to find the largest number of vertices any two of which are adjacent. In the maximum-weight clique problem, the vertices have weights, and one wants to find a clique with maximum weight. A