 |
| ||||
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 | |||||||||
这样行不行:In Reply To:应该把某些npc团数问题规约到这个问题才能证明npc吧? Posted by:ArXoR at 2006-10-30 18:44:10 比如上面说的 对于G的最小团数划分问题 构造G'是一个n个点的完全图, 如果原图G中有(a,b),则G'中dst(a,b)=1,否则dst(a,b)=4 这样明显G'直径<=4 然后加入一个新的点v,得到G''使得任意u属于G',有dst(u,v)=4 这样就使得G''的直径为4 然后在G''上求楼主的问题? Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
