An exact exponential time algorithm for counting bipartite cliques (Q436594): 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.2012.04.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2027185717 / rank | |||
Normal rank | |||
Revision as of 01:47, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact exponential time algorithm for counting bipartite cliques |
scientific article |
Statements
An exact exponential time algorithm for counting bipartite cliques (English)
0 references
25 July 2012
0 references
analysis of algorithms
0 references
exact exponential time algorithms
0 references
counting bipartite cliques
0 references
