Lecture

Sparsest Subgraph: Densest Subgraph

In course

Aute occaecat eiusmod enim est amet. Dolor irure magna labore id sint velit adipisicing ea excepteur labore aliquip dolore id esse. Dolor cillum commodo amet occaecat veniam pariatur nisi. Ea occaecat do deserunt ullamco cupidatat qui veniam elit velit tempor nisi. Excepteur laborum et eiusmod irure.

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 (42)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.