Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs
DOI10.1016/J.EJOR.2018.03.010zbMATH Open1388.90121OpenAlexW2793504318WikidataQ130098768 ScholiaQ130098768MaRDI QIDQ1749486FDOQ1749486
Authors: 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
Recommendations
- General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem
- New heuristic approaches for maximum balanced biclique problem
- Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
- Scale reduction techniques for computing maximum induced bicliques
- Exact exponential-time algorithms for finding bicliques
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Clique relaxations in social network analysis: the maximum \(k\)-plex problem
- Title not available (Why is that?)
- A Defect Tolerance Scheme for Nanotechnology Circuits
- An exact bit-parallel algorithm for the maximum clique problem
- A review on algorithms for maximum clique problems
- On bipartite and multipartite clique problems
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- The Algorithmic Aspects of the Regularity Lemma
- The Complexity of Near-Optimal Programmable Logic Array Folding
- Three new upper bounds on the chromatic number
- PUSH: A generalized operator for the maximum vertex weight clique problem
Cited In (6)
- Computing maximum \(k\)-defective cliques in massive graphs
- Near optimal solutions for maximum quasi-bicliques
- An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem
- General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem
- Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
- New heuristic approaches for maximum balanced biclique problem
Uses Software
This page was built for publication: Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1749486)
