Lecture

Networks: Cuts

Description

This lecture introduces the concept of cuts in a directed graph, which separate the nodes into two sets. By analyzing the arcs that cross the cut, similar to bridges in a city, one can identify the flow between the two sets.

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.