An exact exponential time algorithm for counting bipartite cliques (Q436594): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C69 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C30 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6059703 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
analysis of algorithms | |||
| Property / zbMATH Keywords: analysis of algorithms / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
exact exponential time algorithms | |||
| Property / zbMATH Keywords: exact exponential time algorithms / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
counting bipartite cliques | |||
| Property / zbMATH Keywords: counting bipartite cliques / rank | |||
Normal rank | |||
Revision as of 00:07, 30 June 2023
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
