YoVDO

Faster Minimum k-cut of a Simple Graph

Offered By: IEEE via YouTube

Tags

Graph Theory Courses Algorithms Courses Clustering Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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

Tags

Related Courses

Graph Partitioning and Expanders
Stanford University via NovoEd
The Analytics Edge
Massachusetts Institute of Technology via edX
More Data Mining with Weka
University of Waikato via Independent
Mining Massive Datasets
Stanford University via edX
The Caltech-JPL Summer School on Big Data Analytics
California Institute of Technology via Coursera