The max-cut problem on graphs not contractible to K5

Authors:
Francisco Barahona
Affiliations:
Institut für Operations Research, Universität Bonn, Nassestr. 2, D-5300 Bonn 1, Fed. Rep. Germany
Venue:
Operations Research Letters
Year:
1983

Citing 3
Cited 9

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Node-and edge-deletion NP-complete problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Weakly bipartite graphs and the Max-cut problem

Operations Research Letters

Note: max-cut and containment relations in graphs

Theoretical Computer Science
Optimal cuts in graphs and statistical mechanics

Mathematical and Computer Modelling: An International Journal
A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)

Discrete Optimization
On some weakly bipartite graphs

Operations Research Letters
Minimizing breaks by maximizing cuts

Operations Research Letters
A fast algorithm for minimum weight odd circuits and cuts in planar graphs

Operations Research Letters
The gram dimension of a graph

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Fast planar correlation clustering for image segmentation

ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part VI
On the extension complexity of combinatorial polytopes

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We utilise decomposition properties of graphs not contractible to K"5 to describe the polyhedron of cuts and to give a polynomial algorithm for the max-cut problem.