The maximum edge biclique problem is NP-complete (Q1414242)
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: The maximum edge biclique problem is NP-complete |
scientific article; zbMATH DE number 2006368
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The maximum edge biclique problem is NP-complete |
scientific article; zbMATH DE number 2006368 |
Statements
The maximum edge biclique problem is NP-complete (English)
0 references
20 November 2003
0 references
complexity
0 references
bipartite graphs
0 references
biclique
0 references
