Black Friday 2024: 25+ Ways to Save on Online Learning
Near Optimal Massively Parallel Graph Connectivity

Near Optimal Massively Parallel Graph Connectivity

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

Log n Rounds

4 of 8
Previous
Next

4 of 8

Log n Rounds

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Near Optimal Massively Parallel Graph Connectivity

Automatically move to the next video in the Classroom when playback concludes
  1. 1 Introduction
  2. 2 Model
  3. 3 Local Operations
  4. 4 Log n Rounds
  5. 5 Log Diameter Rounds
  6. 6 Square Algorithm
  7. 7 Invariant
  8. 8 Conclusion

Never Stop Learning.

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

Sign up for free
Someone learning on their laptop while sitting on the floor.