Results 1  10
of
681
Chromatic characterization of biclique covers
, 2003
"... A biclique B of a simple graph G is the edgeset of a complete bipartite (not necessarily induced) subgraph of G. A biclique cover of G is a collection of bicliques covering the edgeset of G. Given a graph G, we will study the following problem: find the minimum number of bicliques which cover the e ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
A biclique B of a simple graph G is the edgeset of a complete bipartite (not necessarily induced) subgraph of G. A biclique cover of G is a collection of bicliques covering the edgeset of G. Given a graph G, we will study the following problem: find the minimum number of bicliques which cover
Fractional biclique covers and partitions of graphs
"... A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, bc ∗ (G), and the fractional biclique partition number, bp ∗ (G), of a graph G. It is observed that bc ∗ (G) andbp ∗ (G) provide lower bounds on the biclique cover and partition numb ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, bc ∗ (G), and the fractional biclique partition number, bp ∗ (G), of a graph G. It is observed that bc ∗ (G) andbp ∗ (G) provide lower bounds on the biclique cover and partition
Secure Frameproof Codes Through Biclique Covers
"... For a binary code Γ of length v, a vword w produces by a set of codewords {w 1,..., w r} ⊆ Γ if for all i = 1,..., v, we have wi ∈ {w 1 i,..., w r i}. We call a code rsecure frameproof of size t if Γ  = t and for any vword that is produced by two sets C1 and C2 of size at most r, then the int ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
, then the intersection of these sets is nonempty. A dbiclique cover of size v of a graph G is a collection of v complete bipartite subgraphs of G such that each edge of G belongs to at least d of these complete bipartite subgraphs. In this paper, we show that for t ≥ 2r, an rsecure frameproof code of size
Biclique Graphs and Biclique Matrices
 JOURNAL OF GRAPH THEORY
, 2009
"... A biclique of a graph G is a maximal induced complete bipartite subgraph of G. Given a graph G, the biclique matrix of G is a {0,1,−1} matrix having one row for each biclique and one column for each vertex of G, and such that a pair of 1, −1 entries in a same row corresponds exactly to adjacent ve ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
A biclique of a graph G is a maximal induced complete bipartite subgraph of G. Given a graph G, the biclique matrix of G is a {0,1,−1} matrix having one row for each biclique and one column for each vertex of G, and such that a pair of 1, −1 entries in a same row corresponds exactly to adjacent
Biclustering of Expression Data
, 2000
"... An efficient nodedeletion algorithm is introduced to find submatrices... ..."
Abstract

Cited by 591 (0 self)
 Add to MetaCart
An efficient nodedeletion algorithm is introduced to find submatrices...
Biclique Coverings and the Chromatic Number
, 903
"... Consider a graph G with chromatic number k and a collection of complete bipartite graphs, or bicliques, that cover the edges of G. We prove the following two results: • If the √bicliques partition the edges of G, then their number is at log2 k least 2. This is the first improvement of the easy lower ..."
Abstract
 Add to MetaCart
Consider a graph G with chromatic number k and a collection of complete bipartite graphs, or bicliques, that cover the edges of G. We prove the following two results: • If the √bicliques partition the edges of G, then their number is at log2 k least 2. This is the first improvement of the easy
Results 1  10
of
681