Covering Graphs with Few Complete Bipartite Subgraphs

We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edge-set of the graph can be covered with at most k bicliques; the biclique partition problem is defined similarly with the additional condition that the bicliques are required to be mutually edge-disjoint. The biclique vertex-cover problem asks whether the vertex-set of the given graph can be covered with at most k bicliques, the biclique vertex-partition problem is defined similarly with the additional condition that the bicliques are required to be mutually vertex-disjoint. All these four problems are known to be NPcomplete even if the given graph is bipartite. In this paper we investigate them in the framework of parameterized complexity: do the problems become easier if k is assumed to be small? We show that, considering k as the parameter, the first two problems are fixed-parameter tractable, while the...

• Type: Conference
• Year: 2007
• Where: FSTTCS
• Authors: Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider
• Keywords: Additional Condition, Biclique Cover Problem, FSTTCS 2007, Problems