153
Voted
COLOGNETWENTE
2010
15 years 3 days ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...