Efficient Construction of Directed Hopsets and Parallel Approximate Shortest Paths

Efficient Construction of Directed Hopsets and Parallel Approximate Shortest Paths

Association for Computing Machinery (ACM) via YouTube Direct link

Decrease search distance

15 of 17

15 of 17

Decrease search distance

Class Central Classrooms beta

YouTube playlists 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. 1 Intro
  2. 2 Single Source Shortest Paths for Directed Graphs
  3. 3 Parallel Shortest Paths - Hopsets
  4. 4 Hopset: Definition
  5. 5 Inexact hopset example
  6. 6 Previous Results for Hopsets
  7. 7 Goal
  8. 8 Algorithm Preliminaries
  9. 9 The Algorithm for distance guess d
  10. 10 Path Related Nodes
  11. 11 Progress with recursion
  12. 12 Bridge nodes
  13. 13 Pivots and shortcutters
  14. 14 Distance limited search
  15. 15 Decrease search distance
  16. 16 Far bridge pivots
  17. 17 Conclusion

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.