An algorithm for reporting maximal \(c\)-cliques (Q817824)

From MaRDI portal
Revision as of 11:07, 24 June 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
An algorithm for reporting maximal \(c\)-cliques
scientific article

    Statements

    An algorithm for reporting maximal \(c\)-cliques (English)
    0 references
    0 references
    0 references
    20 March 2006
    0 references
    maximal \(c\)-connected cliques
    0 references
    maximal-cliques
    0 references
    maximal common induced/edge subgraphs
    0 references
    shape matching
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references