An exact exponential time algorithm for counting bipartite cliques (Q436594): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:04, 30 January 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
