1648 search results - page 3 / 330 » On the generation of bicliques of a graph |
COCOON
2010
Springer
13 years 11 months ago
2010
Springer
COLOGNETWENTE
2010
13 years 2 months 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...
SIAMCOMP
2011
12 years 9 months ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
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...
BMCBI
2010
13 years 6 months ago
2010
Background: A protein binding hot spot is a small cluster of residues tightly packed at the center of the interface between two interacting proteins. Though a hot spot constitutes...