AI, Data Science & Cloud Certificates from Google, IBM & Meta — 40% Off
One plan covers every Professional Certificate on Coursera. 40% off Coursera Plus Annual.
Unlock All Certificates
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.
