Completed
Single Source Shortest Paths for Directed Graphs
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Efficient Construction of Directed Hopsets and Parallel Approximate Shortest Paths
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 Single Source Shortest Paths for Directed Graphs
- 3 Parallel Shortest Paths - Hopsets
- 4 Hopset: Definition
- 5 Inexact hopset example
- 6 Previous Results for Hopsets
- 7 Goal
- 8 Algorithm Preliminaries
- 9 The Algorithm for distance guess d
- 10 Path Related Nodes
- 11 Progress with recursion
- 12 Bridge nodes
- 13 Pivots and shortcutters
- 14 Distance limited search
- 15 Decrease search distance
- 16 Far bridge pivots
- 17 Conclusion
