| [Announcements] | [General Information] | [Additional Material] | [Schedule] | [TD] |
The topic of this course is Graph Algorithms. Graphs are mathematical objects that can model complex networks with varying applications. In this course we will study algorithms that can resolve optimization problems on graphs, focusing mostly on theoretical analysis, but also considering practical programming implementations.
More information on the topics to be covered appears in the schedule below (which will be updated during the semester).
The course consists of 1.5 hours of weekly lectures, followed by 1.5 hours of TD (exercise sessions). For some weeks, the TD session will be scheduled to take place in a computer lab, to allow the students to program some of the algorithms we study. Check your online schedule for details.
Grading: Your final grade is the result of the formula 0.7E+0.3CC, where E is your grade in the final exam and CC is your grade in a midterm exam that will be organized at some point in the middle of the semester.
Here you will find a tentative schedule (updated regularly throughout the semester) and the slides we will use in class.
| Lecture No. | Date | Topic | Notes |
|---|---|---|---|
| 1 | 1/9 | Introduction | slides |
| 2 | 4/9 | BFS | slides |
| TD No. | Exercises | Solutions |
|---|---|---|
| 1 | exercises |