Deterministic Min-cut in Poly-logarithmic Max-flows
Offered By: IEEE via YouTube
Course Description
Overview
Explore a groundbreaking lecture on deterministic min-cut algorithms that achieve poly-logarithmic max-flows, presented by Jason Li from Carnegie Mellon University and Debmalya Panigrahi from Duke University. Delve into cutting-edge research in graph theory and network optimization as these experts discuss innovative techniques for solving minimum cut problems efficiently. Gain insights into the latest advancements in algorithmic design and their potential applications in various fields of computer science and engineering.
Syllabus
Deterministic Min-cut in Poly-logarithmic Max-flows
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
Computing Form and Shape: Python Programming with the Rhinoscript LibraryRhode Island School of Design via Kadenze Algorithms and Data Structures
University of California, San Diego via edX Learning Grasshopper
LinkedIn Learning Stay Ahead in Architecture with Algorithmic Design
LinkedIn Learning Learning Algorithmic Design with Grasshopper
LinkedIn Learning