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

  • Power Point version
  • PDF version
  • Primary Readings

  • Lecture Notes (includes Kernighan-Lin) by J. Demmel from CS267, Spring 1995
  • Lecture Notes (includes Spectral Bisection and proofs) by J. Demmel from CS267, Spring 1995