Max-3-Cut
Emerging2papers using it
2024first seen
The 'Max-3-Cut' benchmark is a graph-based optimization problem used to evaluate the performance of quantum algorithms in finding optimal cuts in graphs where each edge connects three vertices.
The 'Max-3-Cut' benchmark is a graph-based optimization problem used to evaluate the performance of quantum algorithms in finding optimal cuts in graphs where each edge connects three vertices.