New heuristic approaches for maximum balanced biclique problem

DOI10.1016/j.ins.2017.12.012zbMath1461.05223OpenAlexW2771149454MaRDI QIDQ781924

Shaowei Cai, Yiyuan Wang, Minghao Yin

Publication date: 20 July 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2017.12.012

zbMATH Keywords

local searchmassive graphsmaximum balanced biclique problemrobust self-adaptive restarting heuristic

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Generalized core maintenance of dynamic bipartite graphs ⋮ Efficient temporal core maintenance of massive graphs ⋮ General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem

Uses Software

• KONECT

Cites Work

• Unnamed Item
• Unnamed Item
• New local search methods for partial MaxSAT
• An efficient local search framework for the minimum weighted vertex cover problem
• Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks
• Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function
• The NP-completeness column: an ongoing guide
• The Complexity of Near-Optimal Programmable Logic Array Folding
• Tabu Search—Part I
• A Defect Tolerance Scheme for Nanotechnology Circuits
• A novel local search algorithm with configuration checking and scoring mechanism for the set k‐covering problem

This page was built for publication: New heuristic approaches for maximum balanced biclique problem