Exact exponential-time algorithms for finding bicliques

Due to a large number of applications, bicliques of graphs have been widely considered in the literature. This paper focuses on non-induced bicliques. Given a graph G=(V,E) on n vertices, a pair (X,Y), with X,Y@?V, X@?Y=@A, is a non-induced biclique if {x,y}@?E for any x@?X and y@?Y. The NP-complete problem of finding a non-induced (k"1,k"2)-biclique asks to decide whether G contains a non-induced biclique (X,Y) such that |X|=k"1 and |Y|=k"2. In this paper, we design a polynomial-space O(1.6914^n)-time algorithm for this problem. It is based on an algorithm for bipartite graphs that runs in time O(1.30052^n). In deriving this algorithm, we also exhibit a relation to the spare allocation problem known from memory chip fabrication. As a byproduct, we show that the constraint bipartite vertex cover problem can be solved in time O(1.30052^n).

[1]  Dieter Kratsch,et al.  On Independent Sets and Bicliques in Graphs , 2008, Algorithmica.

[2]  René Peeters,et al.  The maximum edge biclique problem is NP-complete , 2003, Discret. Appl. Math..

[3]  Henning Fernau,et al.  Exact Exponential-Time Algorithms for Finding Bicliques in a Graph , 2009 .

[4]  Erik D. Demaine,et al.  07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs , 2007, Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs.

[5]  Dorit S. Hochbaum,et al.  Approximating Clique and Biclique Problems , 1998, J. Algorithms.

[6]  Milind Dawande,et al.  On Bipartite and Multipartite Clique Problems , 2001, J. Algorithms.

[7]  Rolf Niedermeier,et al.  An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover , 1999, J. Algorithms.

[8]  Mihalis Yannakakis,et al.  Node-and edge-deletion NP-complete problems , 1978, STOC.

[9]  Daniel Lokshtanov,et al.  New Methods in Parameterized Algorithms and Complexity , 2009 .

[10]  W. Kent Fuchs,et al.  Efficient Spare Allocation in Reconfigurable Arrays , 1986, 23rd ACM/IEEE Design Automation Conference.

[11]  Erik D. Demaine,et al.  07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs , 2007, Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs.

[12]  Jérôme Amilhastre,et al.  Complexity of Minimum Biclique Cover and Minimum Biclique Decomposition for Bipartite Domino-free Graphs , 1998, Discret. Appl. Math..

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Henning Fernau,et al.  Constraint bipartite vertex cover: simpler exact algorithms and implementations , 2012, J. Comb. Optim..

[15]  Serge Gaspers,et al.  Exponential Time Algorithms - Structures, Measures, and Bounds , 2010 .

[16]  Celina M. H. de Figueiredo,et al.  Generating bicliques of a graph in lexicographic order , 2005, Theor. Comput. Sci..