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

DOI10.1016/J.EJOR.2018.03.010MaRDI QIDQ1749486zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

combinatorial optimizationexact algorithmscliquemathematical formulationtechniques for tight bounds

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• A Defect Tolerance Scheme for Nanotechnology Circuits
• A review on algorithms for maximum clique problems
• An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
• An exact bit-parallel algorithm for the maximum clique problem
• Clique relaxations in social network analysis: the maximum \(k\)-plex problem
• On bipartite and multipartite clique problems
• PUSH: A generalized operator for the maximum vertex weight clique problem
• The Algorithmic Aspects of the Regularity Lemma
• The Complexity of Near-Optimal Programmable Logic Array Folding
• Three new upper bounds on the chromatic number

Cited in

(7)

• Near optimal solutions for maximum quasi-bicliques
• An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem
• Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
• New heuristic approaches for maximum balanced biclique problem
• General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem
• Computing maximum \(k\)-defective cliques in massive graphs
• Scale reduction techniques for computing maximum induced bicliques

Describes a project that uses

Uses Software

• KONECT

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)