A polynomial algorithm for the max-cut problem on graphs without long odd cycles (Q3315282)
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: A polynomial algorithm for the max-cut problem on graphs without long odd cycles |
scientific article; zbMATH DE number 3845350
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial algorithm for the max-cut problem on graphs without long odd cycles |
scientific article; zbMATH DE number 3845350 |
Statements
A polynomial algorithm for the max-cut problem on graphs without long odd cycles (English)
0 references
1984
0 references
polynomial time algorithms
0 references
finite, undirected loopless graphs with multiple edges
0 references
NP-completeness
0 references
combinatorial optimization
0 references
positive edge weights
0 references
max-cut problem
0 references
longest odd cycles
0 references
0 references
0.8385114073753357
0 references
0.8022624850273132
0 references
0.7996694445610046
0 references
