Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

On Dynamic Graph Approximations - The Case of J-Trees

Simons Institute via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a 53-minute lecture on dynamic graph approximations, focusing on j-trees, presented by Gramoz Goranci from the University of Vienna. Delve into the powerful algorithmic paradigm of approximating graphs by j-trees, which has proven effective in accelerating cut-based optimization problems, approximate maximum flows, and exact minimum cost-flow computations. Learn about the dynamic maintenance of j-trees and understand the implications of this approach. Gain insights from the collaborative research conducted by Li Chen, Monika Henzinger, Richard Peng, and Thatchaphol Saranurak in this Simons Institute talk on Dynamic Graphs and Algorithm Design.

Syllabus

On Dynamic Graph Approximations: The case of j-Trees

Taught by

Simons Institute

Reviews

Start your review of On Dynamic Graph Approximations - The Case of J-Trees

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.