Dynamic Graph Algorithms and Their Implementation
Society for Industrial and Applied Mathematics via YouTube
Overview
Syllabus
Introduction
Operations
Performance
Motivations
Undirected graphs
Conditional lower bound
Hierarchical graph decomposition
Spanning trees
Segment type
Local algorithms
Random algorithms
Advantages
Other Advantages
Challenges
Data
Batches
Conferences
Summary
Favorite Future Work
Additional Properties
Audience Questions
Crossfertilization
Taught by
Society for Industrial and Applied Mathematics