Graph Clustering with Surprise: Complexity and Exact Solutions (Q2938102)

From MaRDI portal
Revision as of 10:06, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Graph Clustering with Surprise: Complexity and Exact Solutions
scientific article

    Statements

    title
    Graph Clustering with Surprise: Complexity and Exact Solutions (English)
    0 references
    author
    Tobias Fleck
    0 references
    Andrea Kappes
    0 references
    Dorothea Wagner
    0 references
    publication date
    13 January 2015
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    68Q17
    0 references
    68W40
    0 references
    zbMATH DE Number
    6385918
    0 references
    OpenAlex ID
    W1816590423
    0 references
    arXiv ID
    1310.6019
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2938102&oldid=33574156"
    Powered by MediaWiki