The Complexity of Mining Maximal Frequent Subgraphs (Q5012510)

From MaRDI portal
Revision as of 09:50, 15 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7433145
Language Label Description Also known as
English
The Complexity of Mining Maximal Frequent Subgraphs
scientific article; zbMATH DE number 7433145

    Statements

    The Complexity of Mining Maximal Frequent Subgraphs (English)
    0 references
    0 references
    0 references
    25 November 2021
    0 references
    graph mining
    0 references
    enumeration complexity
    0 references
    maximal frequent subgraphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references