The maximum edge biclique problem is NP-complete (Q1414242): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q60680123, #quickstatements; #temporary_batch_1705817641484 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:54, 31 January 2024
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
