ECTS : 4
Lecturer in charge : Michail LAMPIS (https://www.lamsade.dauphine.fr/~mlampis/)
Language of instruction : French
Teaching hours : 36
Course content:
This course, taught in English, covers the fundamentals of graph theory, its applications in computer science and operations research, and the most important graph algorithms. The focus is on the theoretical analysis of algorithms with performance guarantees. Topics covered include :- Undirected and directed graph fundamentals and representation- Graph Traversal Algorithms (BFS, DFS)- Shortest Path Algorithms- Minimum Spanning Trees- Minimum Cut
Skills to be acquired:
Algorithm design and analysis for graph problems.
Assessment:
Midterm (partiel) and a final exam.