An exact algorithm for MAX-CUT in sparse graphs (Q2467485)

From MaRDI portal
Revision as of 08:14, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
An exact algorithm for MAX-CUT in sparse graphs
scientific article

    Statements

    title
    An exact algorithm for MAX-CUT in sparse graphs (English)
    0 references
    author
    Vangelis Th. Paschos
    0 references
    Frederico Della Croce
    0 references
    M. J. Kamiński
    0 references
    publication date
    21 January 2008
    0 references
    Mathematics Subject Classification ID
    90C35
    0 references
    05C40
    0 references
    05C85
    0 references
    zbMATH DE Number
    5228910
    0 references
    zbMATH Keywords
    MAX-CUT
    0 references
    exact algorithm
    0 references
    sparse graphs
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2467485&oldid=26975377"
    Powered by MediaWiki