Counting Small Induced Subgraphs Satisfying Monotone Properties
Offered By: IEEE via YouTube
Course Description
Overview
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
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