Course Material for CS 602 Applied Algorithms
Course Contents
This course will cover only graph algorithms for various special
classes of graphs. The algorithms will mainly be for recognizing graphs
with special properties and efficiently solving NP-Hard problems for
such classes of graphs.
A textbook- Algorithmic Graph Theory: Perfect Graphs by M. Golumbic
is available in the library (only one copy).
Evaluation Scheme
- Homeworks (20-30%)
- Midsem Exam (30-20%)
- Endsem Exam (50%)
NO AUDITS ALLOWED
You can either credit the course or just attend classes if interested.
I will not correct any homeworks/exams for those not crediting.
End-Semester Exam Solutions
Final Marks and Tentative Grade
Lecture Notes
Homework Problems
You can discuss the problems amongst yourselves but should write the answers
individually in your own words. Preferably use latex and submit a pdf file
by email. For the first two homeworks, you can give handwritten solutions.
Verbatim copying will get an FR grade.
Homework Solutions
Notes from Elsewhere