Explore a comprehensive lecture on the topic of tight bounds for online edge coloring, presented by experts Ilan Reuven Cohen, Binghui Peng, and David Wajc. Delve into advanced graph theory concepts and algorithmic techniques as the speakers discuss the latest developments in online edge coloring algorithms. Gain insights into the challenges and solutions for achieving optimal bounds in dynamic graph scenarios.
Overview
Syllabus
Tight Bounds for Online Edge Coloring
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
-
Sublinear Insights: A Faster Classical Algorithm for Edge Coloring
-
Linear Time and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces
-
Rounding Dynamic Matchings Against an Adaptive Adversary
-
Online Prediction in Sub-linear Space
-
Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs
-
The Complexity of 3-Colouring H-Colourable Graphs
