Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs

DOI10.1016/j.ejor.2018.03.010zbMath1388.90121OpenAlexW2793504318WikidataQ130098768 ScholiaQ130098768MaRDI QIDQ1749486

Xianqiang Yang

Publication date: 17 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.03.010

zbMATH Keywords

combinatorial optimizationcliqueexact algorithmsmathematical formulationtechniques for tight bounds

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem ⋮ An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem ⋮ Computing maximum \(k\)-defective cliques in massive graphs

Uses Software

• KONECT

Cites Work

• Unnamed Item
• Unnamed Item
• An exact bit-parallel algorithm for the maximum clique problem
• Three new upper bounds on the chromatic number
• An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
• PUSH: A generalized operator for the maximum vertex weight clique problem
• A review on algorithms for maximum clique problems
• On Bipartite and Multipartite Clique Problems
• Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
• The Complexity of Near-Optimal Programmable Logic Array Folding
• The Algorithmic Aspects of the Regularity Lemma
• A Defect Tolerance Scheme for Nanotechnology Circuits

This page was built for publication: Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs