YoVDO

Counting Small Induced Subgraphs Satisfying Monotone Properties

Offered By: IEEE via YouTube

Tags

Graph Theory Courses Combinatorics Courses Algorithms Courses Computational Complexity Courses Network Analysis Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a comprehensive lecture on counting small induced subgraphs that satisfy monotone properties, presented by experts Marc Roth from Merton, Oxford, Johannes Schmitt from the Math Institute at the University of Bonn, and Philip Wellnitz from MPII, SIC, Germany. Delve into advanced graph theory concepts and learn about innovative techniques for analyzing and quantifying subgraph structures within larger networks. Gain insights into the applications of these methods in various fields such as computer science, mathematics, and network analysis during this 21-minute IEEE presentation.

Syllabus

Counting Small Induced Subgraphs Satisfying Monotone Properties


Taught by

IEEE FOCS: Foundations of Computer Science

Tags

Related Courses

Analytic Combinatorics, Part I
Princeton University via Coursera
Analytic Combinatorics, Part II
Princeton University via Coursera
Analytic Combinatorics
Princeton University via Coursera
Principles of Computing (Part 1)
Rice University via Coursera
Combinatorics and Probability
Moscow Institute of Physics and Technology via Coursera