On the generation of bicliques of a graph

DOI10.1016/j.endm.2004.03.025zbMath1152.05353OpenAlexW4234360141MaRDI QIDQ5899361

Vânia M. F. Dias, Celina M. Herrera de Figueiredo, Jayme Luiz Szwarcfiter

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2004.03.025

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Consensus algorithms for the generation of all maximal bicliques
• On generating all maximal independent sets
• The maximum edge biclique problem is NP-complete
• On Bipartite and Multipartite Clique Problems
• Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
• A New Algorithm for Generating All the Maximal Independent Sets
• Bicliques in graphs. I: Bounds on their number

This page was built for publication: On the generation of bicliques of a graph