PODC 2021 - Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs
Association for Computing Machinery (ACM) via YouTube
Learn AI, Data Science & Business — Earn Certificates That Get You Hired
Stuck in Tutorial Hell? Learn Backend Dev the Right Way
Overview
AI, Data Science & Cloud Certificates from Google, IBM & Meta — 40% Off
One plan covers every Professional Certificate on Coursera. 40% off Coursera Plus Annual.
Unlock All Certificates
Explore cutting-edge research on restorable shortest path tiebreaking in edge-faulty graphs in this 20-minute conference talk from PODC 2021. Delve into the setup and restoration lemma, examine restorable tiebreaking techniques, and understand the importance of symmetry and consistency in graph algorithms. Discover potential applications of this research and engage with open questions in the field of distributed computing and graph theory.
Syllabus
Intro
Setup
Restoration Lemma
Restorable Tiebreaking
Symmetry and Consistency
Open Question
Applications
Other Applications
Open Questions
Taught by
Association for Computing Machinery (ACM)