Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Ask questions, find answers and collaborate at work with Stack Overflow for Teams.
Ask questions, find answers and collaborate at work with Stack Overflow for Teams. Explore Teams
Teams
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
David Eppstein shows a variant of max-cut problem is NP-harda variant of max-cut problem is NP-hard, which is asked by Aaron.
David Eppstein shows a variant of max-cut problem is NP-hard, which is asked by Aaron.
David Eppstein shows a variant of max-cut problem is NP-completehard, which is asked by Aaron. An special case mentioned by Jukka in the comments is again showed to be NP-complete by Tsuyoshi.
David Eppstein shows a variant of max-cut problem is NP-complete, which is asked by Aaron. An special case mentioned by Jukka in the comments is again showed to be NP-complete by Tsuyoshi.
David Eppstein shows a variant of max-cut problem is NP-hardcomplete, which is asked by Aaron. An special case mentioned by Jukka in the comments is again showed to be NP-complete by Tsuyoshi.
