_zidaoziyan的博客

Maximum CliqueProblem DescriptionGiven 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 edge (v1, v2) in e. Maximum clique is the c

maximum shortest distanceProblem DescriptionThere are n points in the plane. Your task is to pick k points (k>=2), and make the closest points in these k points as far as possible. 

Graph ColoringTime Limit: 1000MS Memory Limit: 10000K     DescriptionYou are to write a program that tries to find an optimal coloring for a given graph. Co