An exact exponential time algorithm for counting bipartite cliques

Konstantin Kutzkov
2012 Information Processing Letters  
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.
doi:10.1016/j.ipl.2012.04.001 fatcat:yol6ix5pcrcubojgoxekfxkfja