Skip to content

PODC 2021 — Session 8 Talk 1 — Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs

137 views

About this video

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

Analyzes restorable shortest path tiebreaking for edge-faulty graphs, teaching fault-tolerant routing and graph-algorithm robustness. PODC talk conveys resilient graph-algorithm design.

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

Part of ACM PODC 2021