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

From MaRDI portal
Revision as of 15:39, 27 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An exact algorithm for MAX-CUT in sparse graphs
scientific article

    Statements