The Complexity of Mining Maximal Frequent Subgraphs (Q5012510)

From MaRDI portal
Revision as of 12:30, 9 December 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q130964094, #quickstatements; #temporary_batch_1733743668271)
(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

    title
    The Complexity of Mining Maximal Frequent Subgraphs (English)
    0 references
    author
    Benny Kimelfeld
    0 references
    Phokion G. Kolaitis
    0 references
    publication date
    25 November 2021
    0 references
    zbMATH Keywords
    graph mining
    0 references
    enumeration complexity
    0 references
    maximal frequent subgraphs
    0 references

    Identifiers

    DOI
    10.1145/2629550
    0 references
    Mathematics Subject Classification ID
    68P15
    0 references
    68Q25
    0 references
    68R10
    0 references
    zbMATH DE Number
    7433145
    0 references
    OpenAlex ID
    W2764187464
    0 references
    Wikidata QID
    Q130964094
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5012510&oldid=38279645"
    Powered by MediaWiki