YoVDO

Dynamic Approximate Shortest Paths and Beyond - Subquadratic and Worst Case Update Time

Offered By: IEEE via YouTube

Tags

Graph Algorithms Courses Data Structures Courses Computational Complexity Courses Algorithm Optimization Courses Shortest Path Algorithms Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore cutting-edge research on dynamic graph algorithms in this 20-minute IEEE conference talk by Jan van den Brand and Danupon Nanongkai. Delve into the latest advancements in dynamic approximate shortest paths, focusing on subquadratic and worst-case update time complexities. Gain insights into innovative techniques for maintaining shortest paths in rapidly changing graph structures, and discover how these algorithms can be applied to solve real-world problems efficiently.

Syllabus

Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst Case Update Time


Taught by

IEEE FOCS: Foundations of Computer Science

Tags

Related Courses

Unordered Data Structures
University of Illinois at Urbana-Champaign via Coursera Determine Shortest Paths Between Routers Using Python
Coursera Project Network via Coursera Trees and Graphs: Basics
University of Colorado Boulder via Coursera Executing Graph Algorithms with GraphFrames on Databricks
Pluralsight Graph Theory Algorithms
Udemy