论文信息 - On Enumerating All Maximal Bicliques of Bipartite Graphs - 字舞流文

On Enumerating All Maximal Bicliques of Bipartite Graphs

Enver Kayaaslan

[1] Noga Alon,et al. Can visibility graphs Be represented compactly? , 1994, Discret. Comput. Geom..

[2] Peter L. Hammer,et al. Consensus algorithms for the generation of all maximal bicliques , 2004, Discret. Appl. Math..

[3] Mihalis Yannakakis,et al. On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..

[4] J. Orlin. Contentment in graph theory: Covering graphs with cliques , 1977 .

[5] Jean Fonlupt,et al. Chromatic characterization of biclique covers , 2006, Discret. Math..