... whole graph:vol(A) =u∈A,v∈Vw(u, v)The normalized cut criterion (N cut) is then de-fined as follows:Ncut(A, B) = cut( A, B)vol(A)+ cut( A, B)vol(B)By minimizing this objective we simultane-ously ... partitions. Thisformulation also allows us to decompose the ob-jective into a sum of individual terms, and formu-late a dynamic programming solution to the mul-tiway cut problem.This criterion ... naturally extended to a k-waynormalized cut: Ncutk(V ) = cut( A1, V − A1)vol(A1)+ . . . + cut( Ak, V − Ak)vol(Ak)where A1. . . Akform a partition of the graph,and V −Akis...