Completed
Gomory-Hu Algorithm Description
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Cut-Equivalent Trees are Optimal for Min-Cut Queries
Automatically move to the next video in the Classroom when playback concludes
- 1 Introduction
- 2 Previous Algorithms for constructing GH Trees
- 3 Min-Cut Data-Structure
- 4 Equivalence Between Min-Cut Data Structure and Cut-Equivalent Tree
- 5 First Result:Yes!
- 6 Corollaries
- 7 Gomory-Hu Algorithm Description
- 8 Tournament
- 9 Expansion
- 10 Gomory-Hu Fails Using Approx.
- 11 Issues with Designing Fast Approx. Algorithms
- 12 Approximation Idea
