Learn about parallel cluster-based breadth-first search algorithms and their applications to shortest path problems in this 29-minute conference talk. Explore advanced techniques for managing parallelism in graph algorithms, focusing on how cluster-BFS can be efficiently parallelized to solve shortest path computations. Discover the theoretical foundations and practical implementations of these algorithms, including their performance characteristics and scalability in parallel computing environments. Examine specific use cases where parallel cluster-BFS provides advantages over traditional approaches, and understand the challenges and solutions involved in effectively managing parallelism for graph traversal problems.