An exact exponential time algorithm for counting bipartite cliques
- 15 July 2012
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 112 (13) , 535-539
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A full derandomization of schöning's k-SAT algorithm2011
- On Independent Sets and Bicliques in GraphsAlgorithmica, 2010
- Exact exponential-time algorithms for finding bicliquesInformation Processing Letters, 2010
- Fast Algorithms for max independent setAlgorithmica, 2010
- A measure & conquer approach for the analysis of exact algorithmsJournal of the ACM, 2009
- Set Partitioning via Inclusion-ExclusionSIAM Journal on Computing, 2009
- A Probabilistic Algorithm for k -SAT Based on Limited Local Search and RestartAlgorithmica, 2002
- An Efficient Exact Algorithm for Constraint Bipartite Vertex CoverJournal of Algorithms, 2001
- Approximating Clique and Biclique ProblemsJournal of Algorithms, 1998
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphsDiscrete Applied Mathematics, 1998