Faster Minimum k-cut of a Simple Graph
Offered By: IEEE via YouTube
Course Description
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
Tags
Related Courses
Aplicaciones de la teoría de grafos a la vida realMiríadax Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X] Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer