Session 2A - New Algorithms and Hardness for Incremental SSSP in Directed Graphs
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% confidencePresents new algorithms and hardness for incremental all-pairs shortest path in directed graphs. Teaches dynamic algorithms and their complexity.
A 23-minute video from Association for Computing Machinery (ACM): “Session 2A - New Algorithms and Hardness for Incremental SSSP in Directed Graphs”.
Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.
Part of STOC 2020