Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications (Q2980894)

From MaRDI portal
Revision as of 19:13, 13 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
Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
scientific article

    Statements

    Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications (English)
    0 references
    0 references
    5 May 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    enumeration of all maximal cliques
    0 references
    branch-and-bound depth-first search algorithms
    0 references
    0 references