CS 594 Graph Algorithms
Tue Thu, 2:00-3:15pm
T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms.
R. Ahuja, L. Magnanti and J. Orlin, Network Flows: Theory, Algorithms, and Applications.
B. Mohar and C. Thomassen, Graphs on Surfaces.
Description of the intended student audience
The course will be accessible to students with some knowledge of algorithms, graph theory, discrete mathematics, and probability theory. Programming experience is not necessary.
Aug 27, 2019. Lecture 1:
Min-Cut and k-Cut.
[Lecture notes by Ario Salmasi]
Aug 29, 2019. Lecture 2:
[Lecture notes by Austin Antoniou]
Sep 3, 2019. Lecture 3:
Algorithms on dense graphs and Szemeredi's Regularity Lemma.
[Lecture notes by Dhanvi Sriram Athmakuri], [Lecture notes by Jason Bello], [Lecture notes by Timothy Carpenter]
Sep 5, 2019. Lecture 4:
Maximum Bipartite Matching.
[Lecture notes by Sherif ElAzzouni]
Sep 10, 2019. Lecture 5:
[Lecture notes by Elena Farahbakhsh]
Sep 12, 2019. Lecture 6.
Christofides algorithm for TSP.
Sep 17, 2019. Lecture 7:
[Lecture notes by Francisco Martinez]