YoVDO

Counting Subgraphs in Sublinear Time

Offered By: Simons Institute via YouTube

Tags

Graph Theory Courses Computer Science Courses Sublinear Algorithms Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore key randomization techniques for estimating subgraph counts without reading entire graphs in this 1-hour lecture by C. Seshadhri from UC Santa Cruz. Delve into simple yet powerful tools that yield optimal results for estimating average degree and triangle count. Gain a thorough understanding of the details, enabling you to recreate these results independently. Part of the Sublinear Algorithms Boot Camp at the Simons Institute, this talk offers insights into a decade of advancements in sublinear graph algorithms.

Syllabus

Counting Subgraphs in Sublinear Time


Taught by

Simons Institute

Related Courses

Sampling-Based Sublinear Low-Rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning
Association for Computing Machinery (ACM) via YouTube Sublinear Algorithms for Gap Edit Distance
IEEE via YouTube High Dimensional Robust Sparse Regression
Simons Institute via YouTube Learning-Augmented Sketches for Frequency Estimation
Simons Institute via YouTube Adaptive Sparse Recovery with Limited Adaptivity
Simons Institute via YouTube