Practical Dynamic Graph Algorithms - Data Structures and Connections Between Models
Offered By: Simons Institute via YouTube
Course Description
Overview
Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore dynamic graph algorithms and their practical applications across multiple computational models in this 43-minute lecture by Quanquan Liu from Northwestern University. Delve into efficient data structures and techniques for solving dynamic graph problems in shared-memory work-depth, MPC, and differential privacy models. Examine specific data structures used for k-core decomposition, densest subgraph, triangle counting, and other local graph problems. Gain insights into the characteristics that make these structures efficient across various computational paradigms, enhancing your understanding of dynamic algorithms in practical settings.
Syllabus
Practical Dynamic Graph Algorithms: Data Structures and Connections Between Models
Taught by
Simons Institute
Related Courses
Generative AI and LLMs on AWSPragmatic AI Labs via edX GenAI and LLMs on AWS
Duke University via Coursera Data Privacy and Anonymization in Python
DataCamp Data Privacy and Anonymization in R
DataCamp Responsible AI for Developers: Privacy & Safety
Google via Google Cloud Skills Boost