随笔分类 -  图论--最大团

maximum shortest distance
摘要：maximum shortest distance Problem Description There are n points in the plane. Your task is to pick k points (k>=2), and make the closest points in th 阅读全文
posted @ 2017-02-20 18:17 勿忘初心0924 阅读(319) 评论(0) 推荐(0) 编辑
Maximum Clique
摘要：Maximum Clique Problem Description Given a graph G(V, E), a clique is a sub-graph g(v, e), so that for all vertex pairs v1, v2 in v, there exists an e 阅读全文
posted @ 2017-02-18 21:37 勿忘初心0924 阅读(173) 评论(0) 推荐(0) 编辑