Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Faster Minimum k-cut of a Simple Graph

IEEE via YouTube

Overview

Explore a cutting-edge algorithm for solving the minimum k-cut problem in simple graphs. Delve into the intricacies of graph theory and optimization as Jason Li presents an innovative approach to partitioning a graph into k components while minimizing the total weight of edges between different components. Learn about the latest advancements in this field and gain insights into potential applications in network design, clustering, and other areas of computer science and mathematics.

Syllabus

Faster Minimum k-cut of a Simple Graph

Taught by

IEEE FOCS: Foundations of Computer Science

Reviews

Start your review of Faster Minimum k-cut of a Simple Graph

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.