YoVDO

A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond

Offered By: IEEE via YouTube

Tags

IEEE FOCS: Foundations of Computer Science Courses Graph Theory Courses Embeddings Courses

Course Description

Overview

Explore a 26-minute IEEE conference talk on a deterministic algorithm for balanced cut and its applications in dynamic connectivity, flows, and other areas. Delve into the research presented by Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, and Thatchaphol Saranurak from various institutions. Learn about dynamic connectivity, the definition of balanced cut, two-way reduction, and the competition game. Gain insights into the embedding algorithm and its implications for solving complex graph problems. Understand how this research contributes to advancements in computer science and algorithm design.

Syllabus

Introduction
Dynamic Connectivity
Defining Balanced Cut
Two Way Reduction
Competition Game
Summary
Embedding
Algorithm
Conclusion


Taught by

IEEE FOCS: Foundations of Computer Science

Tags

Related Courses

Algebra & Algorithms
Moscow Institute of Physics and Technology via Coursera
Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera
Basics of Amazon Detective (Japanese) (日本語吹き替え版)
Amazon Web Services via AWS Skill Builder
Computer Science Fundamentals
Brilliant
Introduction to Linear Algebra
Brilliant