An exact algorithm for MAX-CUT in sparse graphs (Q2467485): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 01:50, 3 February 2024
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
21 January 2008
0 references
MAX-CUT
0 references
exact algorithm
0 references
sparse graphs
0 references