Max-Flow and Friends, In Almost Linear Time
Offered By: Simons Institute via YouTube
Course Description
Overview
Explore groundbreaking advancements in graph algorithms as Sushant Sachdeva from the University of Toronto presents a 32-minute talk on "Max-Flow and Friends, In Almost Linear Time" at the Simons Institute 10th Anniversary Symposium. Delve into the latest research on efficient solutions for maximum flow problems and related graph theory concepts, gaining insights into how these algorithms can be optimized to achieve near-linear time complexity.
Syllabus
Max-Flow and Friends, In Almost Linear Time
Taught by
Simons Institute
Related Courses
Information TheoryThe Chinese University of Hong Kong via Coursera Intro to Computer Science
University of Virginia via Udacity Analytic Combinatorics, Part I
Princeton University via Coursera Algorithms, Part I
Princeton University via Coursera Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera