On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms (Q2062119): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1016/j.tcs.2021.11.005 / rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.TCS.2021.11.005 / rank | |||
Normal rank |
Latest revision as of 22:16, 16 December 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
0 references
0 references