Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing

Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing

Explore a 23-minute IEEE conference talk on advanced graph algorithms, focusing on deterministic decremental reachability, strongly connected components (SCC), and shortest paths. Delve into the innovative approach using directed expanders and congestion balancing presented by researchers from Rutgers University, University of Copenhagen, and TTIC. Learn about the motivation behind this research, the concept of directed expanders, directed sparse cuts, decomposition techniques, and the lift operation. Gain insights into cutting-edge developments in graph theory and their applications to efficient algorithm design for dynamic graph problems.