12 search results - page 1 / 3 » gc 2011 |
115
Voted
GC
2011
Springer
14 years 4 months ago
2011
Springer
105
Voted
GC
2011
Springer
14 years 8 months ago
2011
Springer
132
Voted
GC
2011
Springer
14 years 8 months ago
2011
Springer
109
Voted
GC
2011
Springer
14 years 4 months ago
2011
Springer
128
click to vote
GC
2011
Springer
14 years 4 months ago
2011
Springer
The minimum clique partition (MCP) problem is that of partitioning the vertex set of a given graph into a minimum number of cliques. Given n points in the plane, the corresponding...