On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms (Q2062119)

From MaRDI portal
Revision as of 15:15, 27 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    22 December 2021
    0 references
    maximal cliques
    0 references
    graph enumeration
    0 references
    output sensitive
    0 references
    delay
    0 references

    Identifiers