This talk will be a survey on the topic of graph partitioning, which is
the problem of disconnecting a graph into equal size parts by removing a
small set of edges. Graph partitioning has many applications in areas as
diverse as parallel computations, Gaussian elimination and VLSI circuit
layout. Unfortunately, finding an optimal partition is NP-complete, so
people have resorted to heuristics, and more recently to approximation
algorithms, to solve their partitioning problems.
This information is available at
http://cgm.cs.mcgill.ca/~therese/seminar.
Direct questions, comments, additions to and removals from the mailing list, and
suggestions for speakers to Therese Biedl at
therese@cgm.cs.mcgill.ca.