The maximum edge biclique problem is NP-complete (Q1414242)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The maximum edge biclique problem is NP-complete |
scientific article |
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
