Local improving algorithms for large cuts in graphs with maximum degree three (Q5937918)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Local improving algorithms for large cuts in graphs with maximum degree three |
scientific article; zbMATH DE number 1621227
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Local improving algorithms for large cuts in graphs with maximum degree three |
scientific article; zbMATH DE number 1621227 |
Statements
Local improving algorithms for large cuts in graphs with maximum degree three (English)
0 references
17 January 2002
0 references
NP-complete
0 references
search algorithms
0 references
cut
0 references
switching
0 references
0.9289396
0 references
0.9134736
0 references
0 references
0 references
0.89474666
0 references
0.89046293
0 references
0.8824816
0 references
0.8760747
0 references
0.8747567
0 references
