 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
Re:有一个比较难的问题，想请大家帮忙！In Reply To:有一个比较难的问题，想请大家帮忙！ Posted by:guoxi022 at 2006-10-27 20:54:11 > 有一个无向图，如何把距离比较近的结点分堆，每堆结点的个数不超过k个。 还要补充一下， 要求每个堆中的结点之间的距离 comm(a,b) < 1/4 max(整个图中两个结点的最长距离) Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
