Abstract Maximum biclique search, which finds the with maximum number of edges in a bipartite graph, is fundamental problem wide spectrum applications different domains, such as E-Commerce, social analysis, web services, and bioinformatics. Unfortunately, due to difficulty graph theory, no practical solution has been proposed solve issue large-scale real-world datasets. Existing techniques for ...

Linear cryptanalysis and diierential cryptanalysis are two recently introduced, powerful methodologies for attacking private-key block ciphers. In this paper, we examine the application of these two cryptanalysis techniques to a CAST-like encryption algorithm based on randomly generated s-boxes. It is shown that, when randomly generated substitution boxes (s-boxes) are used in a CAST-like algor...

The Hermitian rank, h(A), of a Hermitian matrix A is de ned and shown to equal maxfn+(A); n (A)g, the maximum of the numbers of positive and negative eigenvalues of A. Properties of Hermitian rank are developed and used to obtain results on the minimum number, b(G), of complete bipartite subgraphs needed to partition the edge set of a graph G. Witsenhausen's inequality b(G) maxfn+(G); n (G)g is...

Abstract Interference exists when a unit's outcome depends on another treatment assignment. For example, intensive policing one street could have spillover effect neighbouring streets. Classical randomization tests typically break down in this setting because many null hypotheses of interest are no longer sharp under interference. A promising alternative is to instead construct conditional test...

By using biclique partitions of digraphs, this paper gives reduction formulas for the number oriented spanning trees, stationary distribution vector and Kemeny's constant digraphs. As applications, we give a method enumerating trees undirected graphs by vertex degrees partitions. The partition formula also extends results Knuth Levine from line digraphs to general