Description:
Watch a 14-minute research talk from RR-Fest where Sepehr Assadi from the University of Waterloo explores sublinear algorithms for vertex coloring, presenting innovative approaches to graph theory and computational efficiency in the context of coloring problems.
Simple Sublinear Algorithms for Vertex Coloring
Add to list
#Computer Science
#Algorithms
#Graph Algorithms
#Mathematics
#Graph Theory
#Computational Complexity
#Combinatorial Optimization
#Sublinear Algorithms
0:00 / 0:00