Simple Sublinear Algorithms for Vertex Coloring

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.