@article{c19b38ce05144e4bb5adcf7fcb1004f5,
title = "An exact exponential time algorithm for counting bipartite cliques.",
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.249^n), improving upon known exact algorithms for finding and counting bipartite cliques.",
keywords = "Analysis of algorithms; Exact exponential time algorithms; Counting bipartite cliques",
author = "Konstantin Kutzkov",
note = "@article{DBLP:journals/ipl/Kutzkov12, author = {Konstantin Kutzkov}, title = {An exact exponential time algorithm for counting bipartite cliques}, journal = {Inf. Process. Lett.}, volume = {112}, number = {13}, year = {2012}, pages = {535-539}, ee = {http://dx.doi.org/10.1016/j.ipl.2012.04.001}, bibsource = {DBLP, http://dblp.uni-trier.de} }",
year = "2012",
language = "English",
volume = "112",
pages = "535--539",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "13",
}