Exact exponential-time algorithms for finding bicliques (Q1944039)
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: Exact exponential-time algorithms for finding bicliques |
scientific article; zbMATH DE number 6150229
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact exponential-time algorithms for finding bicliques |
scientific article; zbMATH DE number 6150229 |
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
0 references
0.9453678
0 references
0 references
0 references
0.89403576
0 references
0.8803077
0 references
0.8798034
0 references
0 references
0 references
0 references
0.87651247
0 references
