Subgraph Counting and Seed Counting in Graph Theory
Offered By: Simons Institute via YouTube
Course Description
Overview
Explore the landscape of sublinear subgraph counting and sampling in this 41-minute lecture by Talya Eden, presented at the Workshop on Local Algorithms (WoLA) hosted by the Simons Institute. Gain insights into why counting seeds is a more logical approach when considering subgraph analysis. Delve into the current state of research in this field, with a focus on collaborative works involving Dana. Learn about the latest developments and methodologies in subgraph counting, and understand the rationale behind preferring seed counting over traditional subgraph counting techniques.
Syllabus
On counting subgraphs and why counting seeds makes more sense (if one thinks about it clearly)
Taught by
Simons Institute
Related Courses
Automata TheoryStanford University via edX Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX 算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera How to Win Coding Competitions: Secrets of Champions
ITMO University via edX Introdução à Ciência da Computação com Python Parte 2
Universidade de São Paulo via Coursera