This course covers the learning outcomes and goals of understanding graph theory and fixed-parameter tractability, teaching skills such as counting patterns in exponential time, fixed-parameter tractability, galactic algorithms, and working with minors and topological minors. The teaching method involves presenting key concepts and algorithms. The intended audience for this course includes individuals interested in theoretical computer science and algorithm design.
Overview
Syllabus
Introduction
Counting patterns in some exponential time
Overview
FixedParameter Tractability
Galactic Algorithms
Disjoint General Graph
Goals
Schema
Algorithm
Daniel
Minors and topological minors
Three key players
Taught by
Association for Computing Machinery (ACM)
