An exact algorithm for MAX-CUT in sparse graphs (Q2467485): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.orl.2006.04.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2039389937 / rank | |||
Normal rank | |||
Revision as of 03:18, 20 March 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
