Basics of Length-Constrained Expanders and Low-step Flow Emulators Thatchaphol Saranurak 315 подписчиков Скачать
Lecture 9.2 Max-flow min-cut theorem via LP duality, Introduction to approximation algorithms Скачать
Lecture 3.1 Traveling salesman, Bellman-Ford, Path-doubling, Floyd-Warshall, Intuition of Dijkstra Скачать
Lecture 7.1 (10 12 2021) Applications of isolating cuts and local min cuts, Intro cut-matching game Скачать
Lecture 5.1 (9 28 2021) Spectral equivalence of expanders, Expander mixing lemma, Ramanujan graphs Скачать
Lecture 5.2 (9 30 2021) Deterministic vertex connectivity in o(n^2) max flow via Ramanujan graphs Скачать
Dynamic Spanning Forest with Worst-case Update Time: Adaptive, Las Vegas, and O(n^{1/2-eps})-time Скачать