Exact exponential-time algorithms for finding bicliques (Q1944039): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2010.10.020 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2136829801 / rank | |||
Normal rank | |||
Revision as of 03:20, 20 March 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
