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
An Introduction to Computer NetworksStanford University via Independent Introduction to Systems Biology
Icahn School of Medicine at Mount Sinai via Coursera Network Analysis in Systems Biology
Icahn School of Medicine at Mount Sinai via Coursera Networks, Crowds and Markets
Cornell University via edX Networking Leadership 101: Building Your Core Professional Network
Center for Creative Leadership via Acumen Academy