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:Re:就一2分图的匹配- - Posted by:01ly at 2008-10-03 17:59:08 建立补图后,如果两边存在孤立的点,说明该点与对面的所有点都认识,对于剩下带边的点, 只要去掉最大匹配数目的点,则可把图形中的边全部去掉,这样剩下的图中全部都是孤立点 了,即为最大独立集。此题与1466 Girls and Boys有些相似。 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator