Description of the course
The course provides an introduction to basic algorithms on graphs. It covers graph traversals (BFS and DFS), greedy algorithms to find MST (Kruskal’s algorithm and Prim’s algorithm) and introduction on approximation algorithms.
- Notes for Lecture I pdf
Exercises to practice
Introduction to algorithms, Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, Clifford Stein
MIT Press, 2001 – 1180 Seiten.