资 源 简 介
For a graph, a maximum cut is a cut whose size is at least the size of any other cut. The problem of finding a maximum cut in a graph is known as the max-cut problem.
We implemented optimized algorithms for finding exact solutions to the problem together with a spectral theory approach by Luca Trevisan for finding approximated solutions in polynomial time.
