DOIAbstract
AbstractWe prove that the maximum edge biclique problem in bipartite graphs is NP-complete
AbstractWe prove that the maximum edge biclique problem in bipartite graphs is NP-complete
AbstractGiven a graph G and a bipartition of its vertices, the edge-ratio is the minimum for both cl...
A bipartite graph G=(A, B, E) is convex on B if there exists an ordering of the vertices of B such t...
Abstract. A bipartite graph G = (A,B,E) is convex on B if there exists an ordering of the vertices o...
We prove that the maximum edge biclique problem in bipartite graphs is NP-complete.A biclique in a b...
AbstractWe prove that the maximum edge biclique problem in bipartite graphs is NP-complete
The Maximum Balanced Biclique Problem (MBBP) is a prominent model with numerous applications. Yet, t...
International audienceThe Maximum Balanced Biclique Problem (MBBP) is a prominent model with numerou...
International audience<p>The Maximum Balanced Biclique Problem (MBBP) is a prominent model with nume...
AbstractWe consider computational problems on covering graphs with bicliques (complete bipartite sub...
| openaire: EC/H2020/759557/EU//ALGOComIn the Maximum Balanced Biclique Problem (MBB), we are given ...
| openaire: EC/H2020/759557/EU//ALGOComIn the Maximum Balanced Biclique Problem (MBB), we are given ...
A biclique of G is a maximal set of vertices that induces a complete bipartite subgraph Kp,q of G w...
Given a bipartite graph G, we consider the decision problem called BicliqueCover for a fixed positiv...
Given a simple, undirected graph G, a biclique is a subset of vertices inducing a complete bipartite...
This is the post-print verison of the Article. The official published version can be accessed from t...
AbstractGiven a graph G and a bipartition of its vertices, the edge-ratio is the minimum for both cl...
A bipartite graph G=(A, B, E) is convex on B if there exists an ordering of the vertices of B such t...
Abstract. A bipartite graph G = (A,B,E) is convex on B if there exists an ordering of the vertices o...
We prove that the maximum edge biclique problem in bipartite graphs is NP-complete.A biclique in a b...
AbstractWe prove that the maximum edge biclique problem in bipartite graphs is NP-complete
The Maximum Balanced Biclique Problem (MBBP) is a prominent model with numerous applications. Yet, t...
International audienceThe Maximum Balanced Biclique Problem (MBBP) is a prominent model with numerou...
International audience<p>The Maximum Balanced Biclique Problem (MBBP) is a prominent model with nume...
AbstractWe consider computational problems on covering graphs with bicliques (complete bipartite sub...
| openaire: EC/H2020/759557/EU//ALGOComIn the Maximum Balanced Biclique Problem (MBB), we are given ...
| openaire: EC/H2020/759557/EU//ALGOComIn the Maximum Balanced Biclique Problem (MBB), we are given ...
A biclique of G is a maximal set of vertices that induces a complete bipartite subgraph Kp,q of G w...
Given a bipartite graph G, we consider the decision problem called BicliqueCover for a fixed positiv...
Given a simple, undirected graph G, a biclique is a subset of vertices inducing a complete bipartite...
This is the post-print verison of the Article. The official published version can be accessed from t...
AbstractGiven a graph G and a bipartition of its vertices, the edge-ratio is the minimum for both cl...
A bipartite graph G=(A, B, E) is convex on B if there exists an ordering of the vertices of B such t...
Abstract. A bipartite graph G = (A,B,E) is convex on B if there exists an ordering of the vertices o...
Add to ORKG