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.

Research highlights
► Consider interval-filament, subtree-filament, polygon-circle and 4-hole-free graphs.
► We present polynomial time algorithms for induced biclique optimization problems.
► Such problems are maximum induced: bicliques, balanced bicliques and edge bicliques.
► Applications are in biclique clustering of proteins by PPI criteria.