CS267: Lecture 15, Mar 9 1999
Graph Partitioning - II
Abstract
We continue our discussion of graph partitioning using edge information
but not nodal coordinates. We present the Kernighan-Lin and Spectral
Bisection algorithms.
Lecture Notes
Primary Readings