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
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