Graph Algorithms Courses and Certifications

IEEE

Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs

Discover efficient algorithms for bipartite matching in moderately dense graphs, exploring nearly-linear time solutions and their implications for graph theory and optimization.

• YouTube
• 24 minutes
• On-Demand
• Free Video

IEEE

Monochromatic Triangles, Triangle Listing and APSP

Explore efficient algorithms for triangle-related problems and their connections to All-Pairs Shortest Paths, presented by MIT researchers Williams and Xu.

• YouTube
• 24 minutes
• On-Demand
• Free Video

IEEE

Dynamic Approximate Shortest Paths and Beyond - Subquadratic and Worst Case Update Time

Explore cutting-edge algorithms for dynamic approximate shortest paths, focusing on subquadratic and worst-case update time complexities in graph theory and network optimization.

• YouTube
• 20 minutes
• On-Demand
• Free Video

IEEE

Sensitive Distance and Reachability Oracles for Large Batch Updates

Explore efficient algorithms for maintaining distance and reachability information in dynamic graphs, focusing on techniques for handling large batch updates.

• YouTube
• 20 minutes
• On-Demand
• Free Video

IEEE

Dynamic Graphs - Session 8B

Explore cutting-edge research on dynamic graph algorithms and their applications in computer science at this IEEE FOCS 2020 session.

• YouTube
• 1 hour 33 minutes
• On-Demand
• Free Video

IEEE

Dynamic Graphs - Session 7B

Explore cutting-edge research on dynamic graph algorithms and their applications in computer science at this IEEE FOCS 2020 session.

• YouTube
• 1 hour 19 minutes
• On-Demand
• Free Video

IEEE

Graph Algorithms and Coding - Session 4C

Explore advanced graph algorithms and coding techniques in this IEEE session, focusing on cutting-edge research and practical applications in computer science.

• YouTube
• 1 hour 15 minutes
• On-Demand
• Free Video

Simons Institute

Graph Data Structures - Part 2

Explore advanced graph data structures and optimization techniques for designing efficient algorithms in this in-depth lecture by Thatchaphol Saranurak.

• YouTube
• 54 minutes
• On-Demand
• Free Video

Simons Institute

Graph Data Structures - Part 1

Explore fundamental graph data structures and their applications in algorithmic optimization, presented by a leading expert from the University of Michigan.

• YouTube
• 58 minutes
• On-Demand
• Free Video

Simons Institute

Graph Data Structures Part 3

Explore advanced graph data structures and optimization techniques for designing efficient algorithms, presented by Thatchaphol Saranurak from the University of Michigan.

• YouTube
• 1 hour 6 minutes
• On-Demand
• Free Video

Association for Computing Machinery (ACM)

Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators

Explore efficient parallel algorithms for approximating undirected shortest paths using low hop emulators, with applications and open problems in graph theory and network analysis.

• YouTube
• 22 minutes
• On-Demand
• Free Video

Pinecone

Graph-Based Approximate Nearest Neighbors and HNSW

Explore graph-based algorithms for efficient nearest neighbor search, focusing on HNSW. Learn advantages, construction, and practical applications in large-scale search solutions.

• YouTube
• 59 minutes
• On-Demand
• Free Video

USENIX

Seraph: Scalable and Efficient Fully-External Graph Computation via On-Demand Processing

Explores Seraph, a novel fully-external graph computation system that balances scalability and efficiency through on-demand processing, hybrid data formats, and selective pre-computation.

• YouTube
• 21 minutes
• On-Demand
• Free Video

Simons Institute

Linear and Sublinear Algorithms for Graphlet Sampling

Explore efficient algorithms for graphlet sampling, including linear and sublinear preprocessing techniques, with applications to semi-streaming and MPC settings.

• YouTube
• 33 minutes
• On-Demand
• Free Video

Simons Institute

Sublinear Insights: A Faster Classical Algorithm for Edge Coloring

Explores a novel randomized algorithm for near-linear time graph edge coloring, improving on decades-old methods. Discusses implications for Vizing's theorem and dense graph coloring efficiency.

• YouTube
• 34 minutes
• On-Demand
• Free Video