Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Counting Small Induced Subgraphs Satisfying Monotone Properties

IEEE via YouTube

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

Reviews

Start your review of Counting Small Induced Subgraphs Satisfying Monotone Properties

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.