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.
Data Visualization GUIs with Dash and Python
Learn to create interactive data visualization interfaces using Dash and Python, covering dynamic graphs, live updates, sentiment analysis, and app deployment for effective data presentation.
A Blackbox Reduction for Adaptive Adversaries Using Differential Privacy
Explore a novel black-box transformation using differential privacy to convert dynamic algorithms from oblivious to adaptive adversary resistance, enhancing algorithm design for dynamic graphs.
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.
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.
Tight Bounds for Online Edge Coloring
Explore cutting-edge algorithms for online edge coloring, examining tight bounds and their implications in graph theory and network optimization.
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.
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.
Minimum Isolating Cuts - A New Tool for Solving Minimum Cut Problems
Explore a powerful new tool for solving minimum cut problems in combinatorial optimization, with applications to global, Steiner, and all-pairs min-cut algorithms.
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.
HOT: Higher-Order Dynamic Graph Representation Learning with Efficient Transformers
Explore higher-order dynamic graph representation learning with efficient Transformers for improved link prediction in rapidly changing graphs. Learn about HOT model's architecture and performance.
How to Get Started With Graph ML - Blog Walkthrough
Comprehensive introduction to Graph Machine Learning, covering applications, methods, and resources. Explores research challenges, GNN expressivity, and related subfields, providing a solid foundation for beginners.
Temporal Graph Networks - GNN Paper Explained
Explore temporal graph networks and dynamic graphs, learning advanced techniques for graph machine learning, including time-based sampling, memory management, and attention mechanisms.
Recent Progress on Sublinear Time Algorithms for Maximum Matching - Upper Bounds
Explore sublinear time algorithms for estimating maximum matching size in graphs, their applications in dynamic graphs, and recent advancements in the field.
Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates
Explore dynamic algorithms for packing-covering LPs using multiplicative weight updates, focusing on near-optimal approximation algorithms and complexity analysis in dynamic settings.
Online List Labeling - Breaking the Log^2 N Barrier
Explores a randomized data structure for online list labeling, improving the upper bound to O(log^{3/2} n) items moved per insertion/deletion, breaking the long-standing log^2 n barrier.
Faster High Accuracy Multi-Commodity Flows via Graph Techniques
Explore graph techniques to accelerate multi-commodity flow algorithms, improving accuracy and efficiency. Discover connections to linear programming and open problems in algorithm design.
Accelerating the Multiplicative-Weights Framework for Graph Linear Programs
Accelerated multiplicative-weight updates framework for solving packing/covering LPs in graph optimization, reducing iterations from Θ(m) to ~Θ(√m) using a packing version of Min-IP oracle.
Recent Progress on Sublinear Time Algorithms for Maximum Matching - Lower Bounds
Explore recent techniques for estimating maximum matching size, focusing on lower bounds and correlation decay methods that lead to super-linear lower bounds for approximations above 2/3.
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.
Dynamic Graphs - Session 8B
Explore cutting-edge research on dynamic graph algorithms and their applications in computer science at this IEEE FOCS 2020 session.