Lecture

Sparsest Cut and Concurrent Flow

In course

Velit ipsum aute duis velit. Proident dolore elit officia aliqua cupidatat dolore anim ex cillum Lorem. Non mollit ea exercitation pariatur enim sint incididunt sint minim. Non culpa qui magna voluptate elit non aliqua deserunt nostrud exercitation. Adipisicing eu voluptate duis cupidatat sit enim. Ea commodo officia deserunt sint excepteur anim labore proident. Id eu ea in magna in excepteur adipisicing fugiat cupidatat.

Description

This lecture covers the concept of sparsest cut in undirected graphs, NP-completeness, and the Bougains Theorem. It also discusses concurrent flow, where flow can be routed between all pairs of vertices simultaneously. Examples of expanders and concurrent flow are provided.

Official source

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

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

Mathematics

Discrete mathematics: Graph theory

Related lectures (34)

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.