51 search results - page 1 / 11 » Dependent Rounding in Bipartite Graphs |
FOCS
2002
IEEE
13 years 10 months ago
2002
IEEE
SIAMDM
2008
13 years 5 months ago
2008
We first show that for any bipartite graph H with at most five vertices, there exists an on-line competitive algorithm for the class of H-free bipartite graphs. We then analyze th...
IACR
2011
12 years 5 months ago
2011
We introduce a new concept in splice-and-cut attacks on hash functions, which bridges the gap between preimage attacks and a powerful method of differential cryptanalysis. The ne...
IPPS
1999
IEEE
13 years 10 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,...
GECCO
2008
Springer
13 years 7 months ago
2008
Springer
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...