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.
Lecture
Low Diameter Random Partitioning
Description
This lecture covers the concept of Low Diameter Randomized Decomposition, focusing on the distance between vertices in a graph and the partitioning of a graph into subgraphs. It discusses the process of random partitioning and the implications for edge cuts and coloring.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.