Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

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

IEEE via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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.

Syllabus

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

Taught by

IEEE FOCS: Foundations of Computer Science

Reviews

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

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.