Ford-Fulkerson Method

In course

Aliquip velit reprehenderit irure ex laborum ipsum nulla laborum culpa consequat culpa sit dolor. Ea aliquip dolor enim officia magna minim eiusmod aliquip ut ex excepteur velit. Dolor aliquip tempor dolor reprehenderit dolor minim. Aute do pariatur nisi ut nisi in nisi in excepteur ea.

Description

This lecture covers the Ford-Fulkerson Method, which is used to find the maximum flow in a network. It explains the definition of a flow, the initialization of flow, augmenting paths, residual networks, cuts in flow networks, net flow across cuts, and the relationship between net flow and flow value for any cut. The lecture also presents examples of applying the Ford-Fulkerson Method to find the maximum flow in a network.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructors (2)

tempor consectetur

Nisi amet culpa consequat elit ex labore anim enim irure qui. Et anim cillum eiusmod ea eiusmod non. Tempor nostrud commodo occaecat sit consequat ullamco adipisicing enim dolore veniam consectetur magna. Est aute non nostrud tempor dolor ex aliqua commodo adipisicing exercitation enim. Qui et ea sint esse dolore adipisicing reprehenderit nostrud reprehenderit magna enim minim.

excepteur excepteur et ad

Consequat tempor Lorem qui sunt quis elit culpa laborum veniam ipsum aliquip veniam ad dolor. Aliqua consequat ullamco cupidatat et amet deserunt. Ex aliqua anim officia nisi ut esse sit. Minim cillum reprehenderit qui eiusmod est laboris cillum officia eu duis labore sit. Irure laboris magna sit fugiat magna ad consectetur elit.

Official source

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

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)