Session 10A - Hitting Topological Minors is FPT

About this video

Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Proves that hitting topological minors is fixed-parameter tractable, a result in parameterized complexity theory. Teaches an FPT algorithm for a graph-theoretic problem.

A 24-minute video from Association for Computing Machinery (ACM): “Session 10A - Hitting Topological Minors is FPT”.

Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.

Part of STOC 2020