Computer Science and Engineering

CSE 258 Spectral Graph Theory

Explores what eigenvalues and eigenvectors of graphs can tell us about their structure, and exploiting this knowledge for algorithmic purposes. It can be thought of as "Advanced Linear Algebra with examples from Graph Theory."

Requirements

Prerequisite(s): linear algebra familiarity. Enrollment is restricted to graduate students, undergraduate students with linear algebra familiarity may enroll by permission of the instructor.

Credits

5