Dynamic Graphs Courses and Certifications

Simons Institute

Dynamic Algorithms for Center on Graphs

Efficient approximation algorithms for k-center problem on dynamic graphs with edge updates. Explores novel techniques in dynamic graph theory and algorithm design.

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

Simons Institute

Dynamic PageRank: Additive Error and Batch Recomputation

Explores dynamic PageRank algorithms, proving hardness of relative error approximations and demonstrating efficiency of batch recomputation for L1 error metric in dynamic graph settings.

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

Simons Institute

Decremental Shortest Paths Against an Adaptive Adversary

Explore efficient algorithms for maintaining shortest paths in dynamic graphs undergoing deletions, with a focus on near-optimal deterministic data structures and adaptive adversary scenarios.

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

Simons Institute

On Dynamic Graph Approximations - The Case of J-Trees

Explores dynamic maintenance of j-trees in graph theory, discussing implications for cut-based optimization, maximum flows, and minimum cost-flow computations in algorithmic design.

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

Simons Institute

Parallel Batch-Dynamic Graph Representations

Explore efficient dynamic graph representations with Aspen and CPAM frameworks, enabling faster updates and space-efficient algorithms for practical applications like dynamic connectivity.

• YouTube
• 53 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

MLOps World: Machine Learning in Production

Machine Learning on Dynamic Graphs - Temporal Graph Networks

Explore Temporal Graph Networks for dynamic graph analysis, unlocking insights in evolving systems like social networks and financial transactions.

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

Strange Loop Conference

PyTorch - Fast Differentiable Dynamic Graphs in Python

Explore PyTorch's dynamic deep learning framework, its high-performance design, and tensor compiler for faster AI research and development using GPUs and CPUs.

• YouTube
• 36 minutes
• On-Demand
• Conference Talk

Discover IBM Instana's observability platform for monitoring cloud-native and microservices applications through architecture, automation, analytics, and alerting capabilities.

• IBM Training
• 6 hours
• On-Demand
• Free Online Course

Simons Institute

Dynamic Graphs on the GPU

Explore GPU-accelerated techniques for dynamic graph algorithms, focusing on efficient data structures and parallel processing for real-time graph updates and analysis.

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

Cambridge University Press

Augmenting Reality with The World Avatar - Dynamic Knowledge Graphs for Data-Centric Engineering

Explore "The World Avatar," a dynamic knowledge graph for digital replication, enabling data-centric engineering across scales to enhance efficiency, reduce costs, and improve sustainability.

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

NashKnolX

Akka Streams: Creating Graphs and Dynamic Components

Learn to create Akka streams graphs using graph DSL, explore non-linear components, and design dynamic graphs for efficient stream processing and ingestion.

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

Simons Institute

Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs

Explore advanced algorithms for dynamic maximum matching using Ordered Ruzsa-Szemeredi Graphs, improving update time to n^{o(1)} * ORS(n) and reducing the problem to a combinatorial bound.

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

Simons Institute

Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs - Towards Constructive Matching Sparsifiers

Explore approaches for designing fast dynamic algorithms for approximate matchings, focusing on fully dynamic settings and the concept of matching sparsifiers in graph theory.

• YouTube
• 1 hour 1 minute
• On-Demand
• Free Video