CS267: Lecture 14, Mar 4 1999

Graph Partitioning - I


We recall the graph partitioning problem, and classify algorithms into those that use nodal coordinates and those that do not. We discuss those that do use nodal coordinates (and in fact ignore all information about edges), and begin discussion of those that do not.

Lecture Notes

  • Power Point version
  • Postscritp version (Power Point died again when trying to produce PDF...)
  • Primary Readings

  • Lecture Notes by J. Demmel from CS267, Spring 1995