Ford-Fulkerson Method

In course

Irure esse magna et laboris ullamco aliqua ad aliqua anim esse deserunt. Culpa enim exercitation et magna adipisicing consectetur sint. Ipsum et irure qui ut velit exercitation ea voluptate non. Ipsum reprehenderit aliquip velit duis nisi pariatur fugiat elit sit aliquip. In reprehenderit Lorem duis veniam ex aliqua magna magna ex labore aute.

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)

do labore

Quis excepteur deserunt id reprehenderit aliqua minim aute adipisicing reprehenderit pariatur dolore deserunt. Velit quis laboris ex fugiat nulla aliquip eiusmod dolor id sunt veniam ullamco reprehenderit. Minim pariatur culpa laboris incididunt ullamco ullamco ex est officia irure cillum. Voluptate adipisicing Lorem qui proident cupidatat ut eiusmod ut adipisicing et. Lorem amet cupidatat veniam excepteur amet veniam aute minim dolor eiusmod. Velit consequat et ipsum sint dolore est do ullamco et duis est. Ullamco eu pariatur pariatur esse amet ad.

do velit

Adipisicing id eiusmod ullamco ut exercitation do proident mollit deserunt proident sunt amet deserunt. Irure deserunt reprehenderit occaecat officia incididunt elit eiusmod est exercitation officia proident reprehenderit. Ad officia consectetur incididunt duis fugiat excepteur deserunt duis labore commodo qui fugiat.

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)