Detail of message

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

复杂度不是一个数量级阿

Posted by TN at 2005-06-17 21:18:58 on Problem 2195
In Reply To:我现在匹配也放弃匈牙利用网络流了，为的就是膜版的统一~ Posted by:palmtenor at 2005-06-17 21:14:55

Followed by:

偷懒，偷懒~ (0) palmtenor 2005-06-17 21:34:00
也许他是用的巨强的网络流。。。 (0) js05 2005-06-17 21:34:21
- 你太看得起他了 (0) TN 2005-06-17 21:34:42
  - 还是TN比较了解我.... (0) palmtenor 2005-06-17 21:36:14
- 所谓巨强的网络流....preflow?btw,SRbGa的论文里曾经提过网络流的匹配比匈牙利要快~估计就是巨强的网络流吧~ (0) palmtenor 2005-06-17 21:37:21
  - 不是的，UnitCapacitySimpleNetwork (0) TN 2005-06-17 21:37:50
    - 哦....就是流为1的特殊情况那个吧~你会？ (0) palmtenor 2005-06-17 21:38:23
    - 不是的，UnitCapacitySimpleNetwork? (0) palmtenor 2005-06-17 23:02:07

Post your reply here:

Home Page Go Back To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator