Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the comparison between random and symmetrical graph coloring, focusing on the colorability of clusters and the equilibrium as clusters disappear, with a detailed analysis of the complexity and entropy involved.