We present a O(mn3) time exact algorithm for finding a minimum 3-cut in an edge-weighted graph. This running time compares very favorably with the best-known algorithm which takes O(mn5) time in the worst case.
