A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is
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