Exact exponential-time algorithms for finding bicliques-Reference-Cited by-同舟云学术

Exact exponential-time algorithms for finding bicliques

Published:2010-12 Issue:2 Volume:111 Page:64-67
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Binkele-Raible Daniel,Fernau Henning,Gaspers Serge,Liedloff Mathieu

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference18 articles.

1. Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs;Amilhastre;Discrete Applied Mathematics,1998

2. Constraint bipartite vertex cover: Simpler exact algorithms and implementations;Bai,2008

3. G. Bai, H. Fernau, Constraint bipartite vertex cover: Simpler exact algorithms and implementations, Journal of Combinatorial Optimization, in press, doi:10.1007/s10878-010-9289-7.

4. On bipartite and multipartite clique problems;Dawande;Journal of Algorithms,2001

5. E. Demaine, G.Z. Gutin, D. Marx, U. Stege, 07281 Open problems, in: Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, in: Dagstuhl Seminar Proceedings, no. 07281, Dagstuhl, Germany, 2007 IBFI.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Parameterized Complexity of the k -Biclique Problem;Journal of the ACM;2018-09-18

2. Scale Reduction Techniques for Computing Maximum Induced Bicliques;Algorithms;2017-10-04

3. A convexity upper bound for the number of maximal bicliques of a bipartite graph;Discrete Applied Mathematics;2014-03

4. Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond;ACM Transactions on Algorithms;2012-12

5. An exact exponential time algorithm for counting bipartite cliques;Information Processing Letters;2012-07