On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms (Q2062119): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:36, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms |
scientific article |
Statements
On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms (English)
0 references
22 December 2021
0 references
maximal cliques
0 references
graph enumeration
0 references
output sensitive
0 references
delay
0 references
