排序:
默认
按更新时间
按访问量

poj 1419(求最大独立集)

Graph Coloring Description You are to write a program that tries to find an optimal coloring for a given graph. Colors are applied to the nodes...

2016-02-14 23:37:27

阅读数:256

评论数:0

poj 2989 All Friends(Born_Kerbosch求极大团个数)

Born_Kerbosh算法个人感觉主要是判重精妙,最大团就是暴搜,谁都会,但求极大团个数的时候需要判重,自己想的时候怎么也想不出来怎么判,后来搜题解搜到了这个算法,发现网上关于这个算法的中文讲解几乎没有。。于是生硬的wiki上面的解释读了下来,附上链接https://en.wikipedia.o...

2016-02-14 20:46:44

阅读数:673

评论数:0

hdoj 3585 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...

2016-02-13 04:03:39

阅读数:527

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭