Get 20% off all career paths from fullstack to AI
Learn the Skills Netflix, Meta, and Capital One Actually Hire For
Overview
AI, Data Science & Cloud Certificates from Google, IBM & Meta — 40% Off
One plan covers every Professional Certificate on Coursera. 40% off Coursera Plus Annual.
Unlock All Certificates
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.
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)