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
Automata TheoryStanford University via edX Intro to Theoretical Computer Science
Udacity Computing: Art, Magic, Science
ETH Zurich via edX 理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX Quantitative Formal Modeling and Worst-Case Performance Analysis
EIT Digital via Coursera