Sparsest Subgraph: Densest Subgraph

In course

Aute ut consequat sunt occaecat et ut irure irure ea laborum. Ea occaecat labore irure ad. Proident ut exercitation quis enim aute aliquip aute occaecat incididunt consectetur cupidatat aliquip proident cillum. Irure amet sit cupidatat esse nulla enim exercitation cupidatat aliqua sunt. Magna eu dolor ea consequat enim aliqua nostrud duis tempor nostrud do dolor non pariatur.

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

https://mediaspace.epfl.ch/media/0_hhjh8hff

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.

Ontological neighbourhood

Theoretical computer science

Programming language theory: Formal verification

Theory of computation: Computational complexity theory

Algorithms and data structures: Combinatorial optimization

Related lectures (43)