CS 408 - Graph Theory

Professor: Abhiram Ranade

Course Description :

The contents of the course are :

1. Graph theory applied to the design of parallel computer networks.
2. Measures such as diameter, bisection width of popular networks.
3. Graph embedding for comparing networks.
4. Graph embedding and partitioning for designing divide and conquer algorithms.
5. Network flow and applications.
6. Matchings in general graphs.
7. Page rank algorithm for web search.
8. Random walks on graphs with applications to graph drawing and graph partitioning.

Course Pattern and Logistics:

2 Quizzes (10 % each) + 1 Midsem (30%) + 1 Endsem (50%)

Comments on the Instructor :

Highly Approachable.  Motivation is provided before every topic. Well explained material is supplied.

Who will find it interesting :

People who find graph algorithms interesting and want to know their applications in different areas of computer engineering.