David Eppstein shows a variant of max-cut problem is NP-hard, which is asked by Aaron.
Hsien-Chih Chang 張顯之
- 7.7k
- 17
- 16
David Eppstein shows a variant of max-cut problem is NP-hard, which is asked by Aaron.