CS-E4555 - Combinatorics, 07.01.2019-12.04.2019
This course space end date is set to 12.04.2019 Search Courses: CS-E4555
Översikt
-
-
Lecture 1 (9 January): Introduction. Algorithms and Structures Sida
-
Lecture 2 (16 January): Graph Coloring Sida
In this class, we will go through some classical greedy and local recoloring based algorithms for graph coloring.
-
Lecture 3 (23 January): Matching Sida
-
Lecture 4 (30 January): Compression of graphs Sida
-
Lecture 5&6 (6, 13 February): Treewidth Sida
-
Lecture 7 (27 February): Randomized Algorithm for Matching & Intro to Probability Sida
-
Lecture 8 (13 March): Probabilistic Method. Linearity of Expectations. Alterations. Chernoff Bounds Sida
-
Lecture 9 (20 March): Lovasz Local Lemma and Satisfiability Sida
-
Lecture 10 (27 March): Optimal Packet Routing. Sida
-
Lecture 11 (3 April): Final exam information & project discussions Sida
-