Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs (Q1987232)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
scientific article

    Statements

    Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 April 2020
    0 references
    enumeration algorithms
    0 references
    maximal cliques
    0 references
    network mining and analytics
    0 references
    reverse search
    0 references
    space efficiency
    0 references
    polynomial-time delay
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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