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

From MaRDI portal
Revision as of 03:18, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
An exact algorithm for MAX-CUT in sparse graphs
scientific article

    Statements

    An exact algorithm for MAX-CUT in sparse graphs (English)
    0 references
    0 references
    0 references
    0 references
    21 January 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    MAX-CUT
    0 references
    exact algorithm
    0 references
    sparse graphs
    0 references
    0 references