Parallel Algorithms for Local Problems in Sparse Graphs

Explore a 36-minute lecture on parallel algorithms for local problems in sparse graphs, presented by Jara Uitto from Aalto University at the Simons Institute. Delve into the challenges of locally checkable problems like vertex coloring and maximal independent set (MIS) in the context of massively parallel computation. Examine the standard technique of graph sparsification and its limitations, particularly for MIS problems. Focus on algorithmic approaches for already sparse graphs, where traditional sparsification becomes irrelevant yet many problems remain computationally challenging. Discover tailored techniques for sparse graphs, with special emphasis on optimizing total space usage in algorithms. Gain insights into the evolving landscape of sublinear graph simplification and its implications for parallel algorithm design.

Parallel Algorithms for Local Problems in Sparse Graphs