Алгоритмы и структуры данных 3. Динамическое программирование (продолжение)

Deskripsi:

0:00 - The lecture begins with an introduction. 4:00 - Set-theoretic operations are discussed. 9:00 - The maximum clique problem in graphs is introduced. 10:30 - A solution with O(2^n * n^2) complexity is presented. 17:50 - A more efficient O(2^n * n) solution is shown. 22:55 - An O(2^n) solution is explained. 30:20 - An O(√2^n) solution is described. 52:10 - The chromatic number of a graph is covered.