作者: Fanica Gavril
DOI: 10.1016/J.IPL.2011.02.005
关键词: Cograph 、 Modular decomposition 、 Chordal graph 、 Combinatorics 、 Discrete mathematics 、 1-planar graph 、 Split graph 、 Indifference graph 、 Algorithm 、 Pathwidth 、 Polygon-circle graph 、 Mathematics
摘要: We present polynomial time algorithms for induced biclique optimization problems in the following families of graphs: polygon-circle graphs, 4-hole-free complements interval-filament graphs and subtree-filament graphs. Such are to find maximum: bicliques, balanced bicliques edge bicliques. These have applications clustering proteins by PPI criteria, documents, web pages.