PODC 2021 - Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs

PODC 2021 - Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs

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.