Partitioning Problem
Given a graph G = (V, E) we want to partition it into k equal-size parts such that the number of edges that straddles partitions is minimized.
Previous slide
Next slide
Back to first slide
View graphic version