Watch a 16-minute research talk from MIT's Talya Eden at the RR-Fest event, exploring efficient methods and algorithms for sampling multiple edges in graphs, presented at the Simons Institute.
Overview
Syllabus
Sampling Multiple Edges Efficiently
Taught by
Simons Institute
Related Courses
-
Subgraph Counting and Seed Counting in Graph Theory
-
Linear and Sublinear Algorithms for Graphlet Sampling
-
Conditional Sampling for Distribution Testing
-
From Fallible DFAs to DFA-Therapy and Things In-Between
-
Sublinear Algorithms in Social Networks via Core-Periphery Decomposition
-
Quantum Algorithm for Path-Edge Sampling
