Fast maximal cliques enumeration in sparse graphs (Q1949748)

From MaRDI portal
Revision as of 16:55, 29 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Fast maximal cliques enumeration in sparse graphs
scientific article

    Statements

    Fast maximal cliques enumeration in sparse graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 May 2013
    0 references
    maximal clique
    0 references
    polynomial delay
    0 references
    sparse graph
    0 references
    \(H\)-partition
    0 references
    \(H\)-value
    0 references

    Identifiers