Counting Subgraphs in Sublinear Time
Offered By: Simons Institute via YouTube
Course Description
Overview
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
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