An exact exponential time algorithm for counting bipartite cliques

Authors:
Konstantin Kutzkov
Affiliations:
IT University of Copenhagen, Denmark
Venue:
Information Processing Letters
Year:
2012

Citing 14
Cited 1

Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs

Discrete Applied Mathematics
Approximating clique and biclique problems

Journal of Algorithms
Data mining: concepts and techniques

Data mining: concepts and techniques
An efficient exact algorithm for constraint bipartite vertex cover

Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The Complexity of Counting in Sparse, Regular, and Planar Graphs

SIAM Journal on Computing
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
A measure & conquer approach for the analysis of exact algorithms

Journal of the ACM (JACM)
Set Partitioning via Inclusion-Exclusion

SIAM Journal on Computing
A tighter bound for counting max-weight solutions to 2SAT instances

IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Exact exponential-time algorithms for finding bicliques

Information Processing Letters
A full derandomization of schöning's k-SAT algorithm

Proceedings of the forty-third annual ACM symposium on Theory of computing
Fast Algorithms for max independent set

Algorithmica
On Independent Sets and Bicliques in Graphs

Algorithmica

Dense subgraph mining with a mixed graph model

Pattern Recognition Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present a simple exact algorithm for counting bicliques of given size in a bipartite graph on n vertices. We achieve running time of O(1.2491^n), improving upon known exact algorithms for finding and counting bipartite cliques.