Catalog · Design and Analysis of Algorithms Lecture 19 of 34 Lecture 19: Synchronous Distributed Algorithms: Symmetry-Breaking. Shortest-Paths Spanning Trees ← Previous Lecture 18: Complexity: Fixed-Parameter Algorithms Next → Lecture 20: Asynchronous Distributed Algorithms: Shortest-Paths Spanning Trees ✓ Mark complete Materials Transcript (PDF) ↗ transcript