Linear Time and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces
Offered By: IEEE via YouTube
Course Description
Overview
Explore a 22-minute IEEE conference talk on linear time and efficient distributed algorithms for list coloring graphs on surfaces. Delve into the intricacies of graph theory and algorithmic design as presented by Luke Postle. Gain insights into cutting-edge techniques for optimizing graph coloring algorithms, particularly those applied to surfaces. Learn about the latest advancements in distributed computing approaches that enhance the efficiency of list coloring processes. Discover how these algorithms can be implemented in linear time, potentially revolutionizing various applications in computer science, network design, and optimization problems.
Syllabus
Linear Time and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
Cloud Computing Concepts, Part 1University of Illinois at Urbana-Champaign via Coursera Cloud Computing Concepts: Part 2
University of Illinois at Urbana-Champaign via Coursera Reliable Distributed Algorithms - Part 1
KTH Royal Institute of Technology via edX Introduction to Apache Spark and AWS
University of London International Programmes via Coursera Réalisez des calculs distribués sur des données massives
CentraleSupélec via OpenClassrooms