Lecture 10: Minimum Cuts by the Contraction Algorithm | UBC CPSC 536N

Lecture 10: Minimum Cuts by the Contraction Algorithm | UBC CPSC 536N

瀏覽:719
日期:2025-04-29
In the first lecture we discussed the Max Cut problem, which is NP-complete, and we presented a very simple algorithm that gives a $latex {1/2}&fg=000000$ approximation. Today we will discuss the Min Cut problem, which is in P, and we will present a very ...看更多