An exact exponential time algorithm for counting bipartite cliques

作者：Kutzkov Konstantin^*

来源：Information Processing Letters, 2012, 112(13): 535-539.

DOI：10.1016/j.ipl.2012.04.001

• Analysis of algorithms
• Exact exponential time algorithms
• Counting bipartite cliques

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.

• 出版日期2012-7-15