An exact exponential time algorithm for counting bipartite cliques (Q436594)
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: An exact exponential time algorithm for counting bipartite cliques |
scientific article; zbMATH DE number 6059703
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact exponential time algorithm for counting bipartite cliques |
scientific article; zbMATH DE number 6059703 |
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
0 references
0.9453678
0 references
0.90217865
0 references
0 references
0.88660663
0 references
0.8814459
0 references
0.87889475
0 references
0.8770653
0 references
0.8743986
0 references
0.8680107
0 references
