![Sublinear Algorithms Wide Format Logo](/sites/default/files/styles/workshop_banner_sm_1x/public/2023-11/Sublinear%20Algorithms.jpg?h=8538f4e5&itok=RTUg456n)
Abstract
In this talk we will consider the following problem, known as graphlet sampling: given an integer k ≥ 3 and a simple graph G, sample a connected induced k-vertex subgraph of G uniformly at random. We will discuss algorithms for this problem with linear and sublinear preprocessing time, as well as some recent adaptations to the semi-streaming and MPC settings.