Session 2A - Fully-dynamic Planarity Testing in Polylogarithmic Time
About this video
Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by videoCovers fully-dynamic planarity testing with polylogarithmic time bounds. Teaches a specific algorithmic problem and its solution approach.
Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.
Part of STOC 2020