Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators
Association for Computing Machinery (ACM) via YouTube
Overview
Explore a 22-minute conference talk delving into parallel approximate undirected shortest paths algorithms using low hop emulators. Learn about hopsests, the main research question, and key results in this field. Discover the differences between low hop emulators and hopsets, and understand their applications. Gain insights into the construction of subemulators and how they contribute to low hop emulators. Conclude with a discussion on open problems in this area of computer science research.
Syllabus
Intro
Parallel Undirected Shortest Paths
Hopsets
Main Question
Our Result
Low Hop Emulator v.s. Hopset
Applications of Low Hop Emulator
Construction of Subemulator
Low Hop Emulator Via Subemulator
Open Problems
Taught by
Association for Computing Machinery (ACM)