Secure frameproof codes through biclique covers
H Hajiabolhassan, F Moazami - Discrete Mathematics & …, 2012 - dmtcs.episciences.org
Secure Frameproof Codes Through Biclique Covers Page 1 Discrete Mathematics and
Theoretical Computer Science DMTCS vol. 14:2, 2012, 261–270 Secure Frameproof Codes …
Theoretical Computer Science DMTCS vol. 14:2, 2012, 261–270 Secure Frameproof Codes …
Biclique cover and local clique cover of graphs
F Moazami - Bulletin of the Iranian Mathematical Society, 2018 - Springer
The biclique (respectively, clique) cover number bc (G)(respectively, cc (G)) of a graph G is
the smallest number of bicliques—complete bipartite subgraphs—(respectively, cliques …
the smallest number of bicliques—complete bipartite subgraphs—(respectively, cliques …
Learning software constraints via installation attempts
Modern software systems are expected to be secure and contain all the latest features, even
when new versions are released multiple times an hour. Each system may include many …
when new versions are released multiple times an hour. Each system may include many …
A note on cover free families
M Azadimotlagh - arXiv preprint arXiv:1505.07090, 2015 - arxiv.org
Let N ((r, w; d), t) denote the minimum number of points in a (r, w; d)-cover-free family having
t blocks. Hajiabolhassan and Moazami (2012)[6] showed that the Hadamard conjecture is …
t blocks. Hajiabolhassan and Moazami (2012)[6] showed that the Hadamard conjecture is …
Nondeterministic communication complexity of random boolean functions
M Pourmoradnasseri, DO Theis - … on Theory and Applications of Models of …, 2017 - Springer
Nondeterministic Communication Complexity of Random Boolean Functions (Extended
Abstract) | SpringerLink Skip to main content Advertisement SpringerLink Account Menu Find a …
Abstract) | SpringerLink Skip to main content Advertisement SpringerLink Account Menu Find a …
A generalization of cover free families
MA Motlagh, F Moazami - arXiv preprint arXiv:1410.4361, 2014 - arxiv.org
An (r; w; d)-cover-free family (CFF) is a family of subsets of a finite set such that the
intersection of any r members of the family contains at least d elements that are not in the …
intersection of any r members of the family contains at least d elements that are not in the …
On the Biclique cover of the complete graph
F Moazami, N Soltankhah - Graphs and Combinatorics, 2015 - Springer
Let KK be a set of kk positive integers. A biclique cover of type KK of a graph GG is a
collection of complete bipartite subgraphs of GG such that for every edge ee of GG, the …
collection of complete bipartite subgraphs of GG such that for every edge ee of GG, the …
A note on d-biclique covers
F Moazami, N Soltankhah, S Basiriz - arXiv preprint arXiv:1207.3397, 2012 - arxiv.org
A d-biclique cover of a graph G is a collection of bicliques of G such that each edge of G is in
at least d of the bicliques. The number of bicliques in a minimum d-biclique cover of G is …
at least d of the bicliques. The number of bicliques in a minimum d-biclique cover of G is …
[PDF][PDF] On Biclique Cover and Partition of the Kneser Graph
M Azadimotlagh - i4c.iust.ac.ir
ABSTRACT Let bcd (G)(resp. bpd (G)) denote the minimum number of bicliques of G such
that every edge of G belongs to at least (resp. exactly) d of these bicliques. Hajiabolhassan …
that every edge of G belongs to at least (resp. exactly) d of these bicliques. Hajiabolhassan …
[PDF][PDF] On the Biclique Cover of Graphs
F Moazami - The 46 th Annual Iranian Mathematics Conference, 2015 - sid.ir
The biclique cover number bc (G) of a graph G is the smallest number of bicliques of G such
that every edge of G belongs to at least one of these bicliques. A k-clique covering of a …
that every edge of G belongs to at least one of these bicliques. A k-clique covering of a …