Description of the course
The course provides an introduction to graph theory and graph algorithms. It covers: Basic definitions in Graph Theory (directed and undirected graphs, basic terminology, paths and circuits, trees and their properties, rooted trees, spanning trees, etc.), Graph traversals (BFS and DFS), Shortest paths in weighted graphs (Dijkstra’s algorithm), Maximum Matchings.
Lecture notes
Practice material
- Some exercises to practice. pdf
Past exams
- Attention only the exercises related to the part of Discrete Maths are shown.
- Exercise 2016 pdf
- Exercise 2014 pdf
- Exercise 2013 pdf
- Exercise 2012 pdf
Textbooks
-
J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, North-Holland, 1976. (This book is out of
print. You can download your personal copy from the web page: http://book.huihoo.com/pdf/graph-theory-With-applications/pdf/GTWA.pdf) - Thomas H. Cormen, Clifford Stein, Ronald L. Rivest, and Charles E. Leiserson. Introduction to Algorithms (2nd ed.). McGraw-Hill Higher Education.
- R. Diestel, Graph Theory, 4th edition, Springer, 2010. See electronic edition at: http://diestel-graph-theory.com/
