Finding good approximate vertex and edge partitions is NP-hard (Q1198051)

From MaRDI portal
Revision as of 06:42, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Finding good approximate vertex and edge partitions is NP-hard
scientific article

    Statements

    title
    Finding good approximate vertex and edge partitions is NP-hard (English)
    0 references
    author
    Thang Nguyen Bui
    0 references
    Curt Jones
    0 references
    publication date
    16 January 1993
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68R05
    0 references
    68R10
    0 references
    05C99
    0 references
    zbMATH DE Number
    92110
    0 references
    zbMATH Keywords
    graph partitioning
    0 references
    approximation algorithm
    0 references
    NP-hard
    0 references
    separators
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1198051&oldid=13255182"
    Powered by MediaWiki