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

都说了不是np-hard了

Posted by c0500448242 at 2005-08-05 01:10:03 on Problem 1016
In Reply To:ft...你也喜欢搞这个np-hard啊…… Posted by:frkstyc at 2005-08-05 01:09:43

Followed by:

degree-bounded minimum spanning tree就是np-hard嘛 (0) frkstyc 2005-08-05 01:10:32
- 但是只有一个点的话,就不是np-hard的了嘛.图论书上有证明的. (0) c0500448242 2005-08-05 01:11:25
  - 那个就不叫DBMST了 (0) frkstyc 2005-08-05 01:12:26
按Lihaoyuan的分类在做搜索题,于是看到这个题了,于是就写起生成树来了. (0) c0500448242 2005-08-05 01:10:41
- 一般的mst有，奇怪的mst没有 (0) frkstyc 2005-08-05 01:11:49
  - 这个......很奇怪么? (0) c0500448242 2005-08-05 01:12:36
    - 不管了，到时候你的打出来就是library的一部分了 (0) frkstyc 2005-08-05 01:14:52
      - 我尽量把它背下来吧...:) (0) c0500448242 2005-08-05 01:16:08
        ft!!你背它干什么！ (0) frkstyc 2005-08-05 01:17:00
        如果写得烂熟,不就等于背下来了么? (0) c0500448242 2005-08-05 01:19:44
        你今晚就练打字吧，把它敲100遍 (0) frkstyc 2005-08-05 01:20:22

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