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
Automata TheoryStanford University via edX Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX 算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera How to Win Coding Competitions: Secrets of Champions
ITMO University via edX Introdução à Ciência da Computação com Python Parte 2
Universidade de São Paulo via Coursera