Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs
type: Item
instance of: scholarly article
title: Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs
zbMATH Open document ID: 1388.90121
author: Xianqiang Yang
published in: European Journal of Operational Research
publication date: 2018-05-17T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6869335
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: clique
zbMATH Keywords: exact algorithms
zbMATH Keywords: techniques for tight bounds
zbMATH Keywords: mathematical formulation
describes a project that uses: KONECT
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.03.010
OpenAlex ID: W2793504318
cites work: A Defect Tolerance Scheme for Nanotechnology Circuits
cites work: The Algorithmic Aspects of the Regularity Lemma
cites work: Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
cites work: On bipartite and multipartite clique problems
cites work: Q4198056
cites work: The Complexity of Near-Optimal Programmable Logic Array Folding
cites work: An exact bit-parallel algorithm for the maximum clique problem
cites work: Three new upper bounds on the chromatic number
cites work: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
cites work: Q4254875
cites work: A review on algorithms for maximum clique problems
cites work: PUSH: A generalized operator for the maximum vertex weight clique problem
Wikidata QID: Q130098768
DOI: 10.1016/J.EJOR.2018.03.010
description: scientific article; zbMATH DE number 6869335