17 search results - page 4 / 4 » Randomly coloring sparse random graphs with fewer colors tha... |
KDD
2012
ACM
11 years 7 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
FLAIRS
2004
13 years 6 months ago
2004
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...