Алгоритмы и структуры данных 11. Потоки продолжение

Descripción:

0:00 – The lecture opens with an introduction. 0:46 – The lecturer presents a consequence derived from a lemma. 3:19 – A technique for scaling flows is explained. 9:52 – The asymptotic behavior of scaling is discussed. 19:30 – Dinic's algorithm is introduced. 26:32 – The search for a blocking flow is covered. 39:30 – The asymptotic complexity of finding a blocking flow is analyzed. 44:41 – A lemma is presented. 51:26 – It is shown that the algorithm runs in O(V^2 * E). 52:30 – A brief moment of reflection. 54:36 – Definitions are given. 57:28 – Lemma 1 is stated. 1:03:13 – Lemma 2 is discussed. 1:07:04 – The first theorem of Karzanov is presented. 1:12:09 – Dinic's algorithm in unit networks is examined.