A k form a partition of the graph, and V −A k is the set difference between the entire graph and partition k. Decoding Papadimitriou proved that the problem of minimizing normalized cuts on graphs is N P -complete (Shi and Malik, 2000).
in our case, the multi-way cut is constrained to preserve the linearity of the segmentation.