lu.se

Datavetenskap

Lunds Tekniska Högskola

Denna sida på svenska This page in English

Lectures

Lecture schedule 2018
ContentSkeppstedt

Kleinberg/Tardos

1Introduction4.81
2Data structures, and fundamental graph algorithms3, 4.1-4.43 plus Tarjan's algorithm not in KT book
3Greedy algorithms2.4.14.1–4.2
4Shortest paths and spanning trees4.5, 4.64.4–4.6
5Divide and conquer2.4.25.1–5.4
6Dynamic programming2.4.36.1–6.6
Dynamic programming  continued5.1-5.26.7-6.10
7Network flow4.77.1–7.4
Network flow continued
8Computational complexity68.1–8.10
Computational complexity continued
9Guest lecture: graph coloring