Algorithms for induced biclique optimization problems

作     者：Gavril, Fanica 

作者机构：Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel 

出 版 物：《INFORMATION PROCESSING LETTERS》 (信息处理快报)

年 卷 期：2011年第111卷第10期

页      面：469-473页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Graph algorithms Induced biclique Induced balanced biclique Polygon-circle graph Interval-filament graph Protein-Protein-Interaction 

摘      要：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.