@article{Dias2005240,
abstract = {An independent set of a graph is a subset of pairwise non-adjacent vertices. A complete bipartite set B is a subset of vertices admitting a bipartition B=X[union or logical sum]Y, such that both X and Y are independent sets, and all vertices of X are adjacent to those of Y. If both X,Y[not equal to][empty set], then B is called proper. A biclique is a maximal proper complete bipartite set of a graph. We present an algorithm that generates all bicliques of a graph in lexicographic order, with polynomial-time delay between the output of two successive bicliques. We also show that there is no polynomial-time delay algorithm for generating all bicliques in reverse lexicographic order, unless P=NP. The methods are based on those by Johnson, Papadimitriou and Yannakakis, in the solution of these two problems for independent sets, instead of bicliques.},
author = {Dias, VĂ¢nia M.F. and de Figueiredo, Celina M.H. and Szwarcfiter, Jayme L.},
doi = {DOI: 10.1016/j.tcs.2005.01.014},
interhash = {db3c1613d7356478877463a22cecedd4},
intrahash = {a60e9536a13fe8f8250b9dac4005130d},
issn = {0304-3975},
journal = {Theoretical Computer Science},
number = {1-3},
pages = {240 - 248},
title = {Generating bicliques of a graph in lexicographic order},
url = {http://www.sciencedirect.com/science/article/B6V1G-4FD0HTT-3/2/7efa1ee4d7b4823c7315a58b94f2f280},
volume = 337,
year = 2005
}