1221 search results - page 29 / 245 » Balanced graph partitioning |
KDD
2001
ACM
14 years 9 months ago
2001
ACM
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
DAM
2008
13 years 8 months ago
2008
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
MFCS
2009
Springer
14 years 3 months ago
2009
Springer
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...
WG
2007
Springer
14 years 2 months ago
2007
Springer
SODA
2008
ACM
13 years 10 months ago
2008
ACM