2018年1月8日
算法课本课后题解_8.15
摘要： Description: Show that the following problem is NP-complete. MAXIMUM COMMON SUBGRAPH Input: Tswo graphes G1=(V1,E1) and G2=(V2,E2); a budget b. Output 阅读全文
posted @ 2018-01-08 19:00 SYSU_Bango 阅读(151) 评论(0) 推荐(0)