Session 10A - An Exponential Time Parameterized Algorithm for Planar Disjoint Paths

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

Presents exponential-time parameterized algorithm for planar disjoint paths. Teaches parameterized algorithms for restricted graph structures.

A 24-minute video from Association for Computing Machinery (ACM): “Session 10A - An Exponential Time Parameterized Algorithm for Planar Disjoint Paths”.

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

Part of STOC 2020