Algorithms for induced biclique optimization problems
We present polynomial time algorithms for induced biclique optimization problems in the following families of graphs: polygon-circle graphs, 4-hole-free graphs, complements of interval-filament graphs and complements of subtree-filament graphs. Such problems are to find maximum: induced bicliques, induced balanced bicliques and induced edge bicliques. These problems have applications for biclique clustering of proteins by PPI criteria, of documents, and of web pages. (C) 2011 Elsevier B.V. All rights reserved.
induced biclique polygon-circle graph interval-filament graph induced balanced biclique graph algorithms protein-protein-interaction