Maximizing edge-ratio is NP-complete (Q765326)

From MaRDI portal
Revision as of 03:09, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Maximizing edge-ratio is NP-complete
scientific article

    Statements

    title
    Maximizing edge-ratio is NP-complete (English)
    0 references
    author
    Steven D. Noble
    0 references
    Pierre Hansen
    0 references
    Nenad Mladenović
    0 references
    publication date
    19 March 2012
    0 references
    zbMATH Keywords
    graph clustering
    0 references
    community detection
    0 references
    edge-ratio
    0 references
    NP-completeness
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q17
    0 references
    05C35
    0 references
    05C70
    0 references
    zbMATH DE Number
    6015777
    0 references
    OpenAlex ID
    W2055422348
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q765326&oldid=38475818"
    Powered by MediaWiki