MaxCut is a classical NP -complete problem and a crucial building block in many combinatorial algorithms. The famous Edwards-Erdös bound states that any connected graph on n vertices with m edges contains a cut of size at least m 2 + n - 1 4 . Crowston, Jo... ...

请注册登录后继续浏览