Explore cutting-edge concepts in dynamic algorithms through this 54-minute ACM conference talk. Delve into directed graphs, ES trees, and graph greed while uncovering the intricacies of balanced embeddings. Gain insights into the densest subgraph problem, dual solutions, and direction problems. Engage with audience questions and participate in discussions on dynamic meshing. Enhance your understanding of advanced algorithmic techniques and their applications in computer science.
Overview
Syllabus
Introduction
Directed Graphs
ES Tree
Graph
Greed
Balanced embeddings
Questions
Densest Subgraph Problem
Dual Solution
Direction Problem
Audience Question
Dynamic Meshing
Discussion
Thanks
Taught by
Association for Computing Machinery (ACM)
Related Courses
-
Data Structures and Algorithms in Python - Full Course for Beginners
4.6 -
Data Structures & Algorithms IV: Pattern Matching, Dijkstra’s, MST, and Dynamic Programming Algorithms
5.0 -
Data Structures and Algorithms in Python
-
Algorithms Course - Graph Theory Tutorial from a Google Engineer
-
Data Structures and Algorithms with Visualizations – Full Course (Java)
-
New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs
