Instructor:
Prof. Ambedkar Dukkipati, Prof. Anand Louis
Venue: CSA 117
Time: Monday and Wednesday (3:30-5:00 pm)
Spectral graph algorithms are very popular in theoretical computer science and machine learning, as they provide polynomial time approximations to several hard computational problems. This course will cover some basic topics in spectral graph theory and algorithms with some application to network analysis. This course emphasises rigorous analysis of algorithms.
References