PODC 2021 - Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs
Offered By: Association for Computing Machinery (ACM) via YouTube
Course Description
Overview
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)
Related Courses
Aplicaciones de la teoría de grafos a la vida realMiríadax Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X] Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer