Near Optimal Massively Parallel Graph Connectivity
Offered By: IEEE via YouTube
Course Description
Overview
Explore cutting-edge research on massively parallel graph connectivity algorithms in this IEEE conference talk. Delve into the intricacies of local operations, log n rounds, and log diameter rounds as presented by experts Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Łącki, and Vahab Mirrokni. Gain insights into the square algorithm and its invariant, and understand the implications for near-optimal solutions in graph theory. This 22-minute presentation covers key concepts from the introduction to the conclusion, offering a comprehensive overview of advanced techniques in parallel computing for graph connectivity problems.
Syllabus
Introduction
Model
Local Operations
Log n Rounds
Log Diameter Rounds
Square Algorithm
Invariant
Conclusion
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against NatureIEEE via YouTube Computation in the Brain Tutorial - Part 2
IEEE via YouTube Computation in the Brain - Part 1
IEEE via YouTube Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
IEEE via YouTube Cookbook Lower Bounds for Statistical Inference in Distributed and Constrained Settings - Part 1
IEEE via YouTube