Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems

Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems

Explore a 21-minute IEEE conference talk on multi-pass graph streaming lower bounds for various problems including cycle counting, MAX-CUT, and matching size. Delve into the research presented by authors Sepehr Assadi, Gillat Kol, Raghuvansh Saxena, and Huacheng Yu from Rutgers University and Princeton University. Gain insights into their findings and methodologies as they address these complex graph theory challenges in the context of streaming algorithms. Learn about the implications of their work for understanding the limitations and potential optimizations in graph processing within constrained memory environments.