The biclique k-clustering problem in bipartite graphs and its application in bioinformatics

DOI10.1016/j.endm.2010.05.021zbMath1237.90240OpenAlexW2021281460WikidataQ57707483 ScholiaQ57707483MaRDI QIDQ2883562

Eduardo Moreno, Alexandre S. Freire, Vicente Acuña, Carlos E. Ferreira

Publication date: 13 May 2012

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

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

zbMATH Keywords

biclusteringmaximum edge bicliquebiclique clustering

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Solving the maximum edge biclique packing problem on unbalanced bipartite graphs

Uses Software

• Gurobi
• efmtool

Cites Work

• On the complexity of approximating the independent set problem
• The maximum edge biclique problem is NP-complete
• Biclique completion problems for multicast network design
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Inapproximability of Maximum Weighted Edge Biclique and Its Applications

This page was built for publication: The biclique k-clustering problem in bipartite graphs and its application in bioinformatics