Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems
Offered By: IEEE via YouTube
Course Description
Overview
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
Tags
Related Courses
Aplicaciones de la teoría de grafos a la vida realMiríadax Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X] Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer