Fine-Grained Complexity and Algorithm Design for Graph Reachability and Distance Problems

Explore the intricacies of fine-grained complexity and algorithm design for graph reachability and distance problems in this 52-minute lecture by Karl Bringmann from the Max Planck Institute for Informatics. Delve into the fascinating world of graph theory and computational complexity as part of the "Fine-Grained Complexity, Logic, and Query Evaluation" series presented by the Simons Institute. Gain insights into advanced algorithmic techniques and their applications in solving complex graph-related challenges, enhancing your understanding of theoretical computer science and its practical implications.

Fine-Grained Complexity and Algorithm Design for Graph Reachability and Distance Problems