Exact exponential-time algorithms for finding bicliques (Q1944039): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:56, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact exponential-time algorithms for finding bicliques |
scientific article |
Statements
Exact exponential-time algorithms for finding bicliques (English)
0 references
4 April 2013
0 references
graph algorithms
0 references
exact exponential-time algorithms
0 references
NP-hard problem
0 references
complete bipartite subgraphs
0 references
bicliques
0 references
