Back to search
On the cut polytope
Data up to Jan 2025
Published1986
Citations385
References10
Total Citations Per Year
Abstract
References (10)
Computers and Intractability: A Guide to the Theory of NP-Completeness
1979 • 45,565 citations
The ellipsoid method and its consequences in combinatorial optimization
1981 • 2,062 citations
On the computational complexity of Ising spin glass models
1982 • 1,248 citations
On the notion of balance of a signed graph.
1953 • 958 citations
Finding a Maximum Cut of a Planar Graph in Polynomial Time
1975 • 403 citations
The max-cut problem on graphs not contractible to K5
1983 • 151 citations
Matroids and Multicommodity Flows
1981 • 139 citations
Facets of the Bipartite Subgraph Polytope
1985 • 81 citations
A polynomial algorithm for the max-cut problem on graphs without long odd cycles
1984 • 40 citations
Deleted Work
1955 • 0 citations
Cited By (0)
Loading...