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
Sparsest Subgraph: Densest Subgraph
Description
This lecture covers the concepts of Sparsest Subgraph and Densest Subgraph, focusing on correlation clustering, runtime analysis, diversification, and approximation algorithms. The instructor discusses optimization problems, round complexity, and the relationship between the two subgraphs.
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.