Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing
Offered By: IEEE via YouTube
Course Description
Overview
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.
Syllabus
Introduction
Strongly Connected Components
Motivation
Deterministic Decremental SCC
Directed Expanders
Directed sparse cuts
Decomposition
Lift
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
An Introduction to Computer NetworksStanford University via Independent Introduction to Systems Biology
Icahn School of Medicine at Mount Sinai via Coursera Network Analysis in Systems Biology
Icahn School of Medicine at Mount Sinai via Coursera Networks, Crowds and Markets
Cornell University via edX Networking Leadership 101: Building Your Core Professional Network
Center for Creative Leadership via Acumen Academy