Two-Way Partitioning(Kernighan & Lin)
Repeat (2)-(4) on a new pair until all nodes exhausted
If sum to m > 0, some gain, so repeat until sum to m=0
What is the time and memory complexity of this algorithm?
i
1
2
3
m
n
Previous slide
Next slide
Back to first slide
View graphic version