1 Efficient Computation, The Department2 Theoretical Computer Science, The Department
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.249^n), improving upon known exact algorithms for finding and counting bipartite cliques.
Information Processing Letters, 2012, Vol 112, Issue 13, p. 535-539
Analysis of algorithms; Exact exponential time algorithms; Counting bipartite cliques