A polynomial algorithm for the max-cut problem on graphs without long odd cycles (Q3315282)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial algorithm for the max-cut problem on graphs without long odd cycles |
scientific article |
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
