BrighterTube

Session 10A - Three-in-a-tree in near linear time

Association for Computing Machinery (ACM)49.8K subscribers

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

Solves three-in-a-tree subgraph problem in near-linear time, advancing parameterized tree algorithms. Teaches graph-theoretic algorithms on restricted structures.

A 19-minute video from Association for Computing Machinery (ACM): “Session 10A - Three-in-a-tree in near linear time”.

Programming & CSScience & Math

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

Part of STOC 2020