演算法›Ch5 NP Complete Problems第 16 題／共 30 題
16. MINCUT、Complexity Classes
#AL-05-016中MINCUTComplexity Classes
- Assume . The MINCUT problem is to partition the vertices in a graph into two disjoint sets so that the number of edges between vertices in different sets is minimized. Choose all and only those complexity classes that are known to contain the corresponding MINCUT decision problem.
📄 交大111
▤完整推導請見《WH 資工筆記 · 演算法》Ch5 NP Complete Problems