18 search results - page 2 / 4 » Convex p-partitions of bipartite graphs |
IPPS
1999
IEEE
13 years 8 months ago
1999
IEEE
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
MFCS
2007
Springer
13 years 10 months ago
2007
Springer
COCOON
2010
Springer
13 years 9 months ago
2010
Springer
WG
2000
Springer
13 years 8 months ago
2000
Springer
ESA
2011
Springer
12 years 4 months ago
2011
Springer
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...