
Social networks, financial networks, road networks, computer networks, neural networks  these are only some of the networks we encounter in our lives. Graphs are a mathematical abstraction for studying networks. In this course we'll look at some of these networks, and study algorithms for analysing them. Topics we will cover include matchings, maximum flows, minimum cuts (and other types of cuts), planarity in graphs, and games on graphs.
Course instructors: Umang Bhaskar and Juhi Chaudhary 

Classes will be held July 22nd  26th in AG66. 




Session 1a: Basic graph algorithms. Notes  pptx and pdf.  
Session 2a: A card trick, and Eulerian walks. Notes  pptx and pdf.
Session 2b: The Traveling Salesperson Problem (TSP)  pptx and pdf. References:
 
Session 3: Catch them if you can  cops and robbers  pdf.  
Session 4a: The Graham Pollak theorem  pdf.
Session 4b: The PageRank algorithm, and Markov chains  pdf. References:
 
Session 5: Maximum flows, minimum cuts, and the FordFulkerson algorithm  pdf.
 
And the end of all our exploring Will be to arrive where we started And know the place for the first time. Happy explorations! 