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.
Overview
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
-
Exponentially Faster Massively Parallel Maximal Matching
-
Parallel Reachability in Almost Linear Work and Square Root Depth
-
Graph Algorithms in the Massively Parallel Computation Model
-
Stochastic Weighted Matching - 1-Epsilon Approximation
-
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond
-
Near-Linear Size Hypergraph Cut Sparsifiers
