Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs (Q1749486)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs |
scientific article; zbMATH DE number 6869335
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs |
scientific article; zbMATH DE number 6869335 |
Statements
Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs (English)
0 references
17 May 2018
0 references
combinatorial optimization
0 references
clique
0 references
exact algorithms
0 references
techniques for tight bounds
0 references
mathematical formulation
0 references
0 references
0.840205192565918
0 references
0.8339091539382935
0 references
0.8079811930656433
0 references
0.768585741519928
0 references
0.7616055607795715
0 references
