On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms (Q2062119): 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.tcs.2021.11.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3215076828 / rank | |||
Normal rank | |||
Revision as of 02:26, 20 March 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
