Unweighted Bipartite Matching

In course

Veniam ex enim cupidatat reprehenderit. Non anim sit labore pariatur. Dolor eiusmod eiusmod proident duis ullamco Lorem ea est et esse duis labore pariatur dolor. Exercitation culpa fugiat occaecat magna. Mollit quis eiusmod nostrud qui eu veniam.

Description

This lecture covers the unweighted bipartite matching problem and its solution using linear programming. The instructor explains the definition of unweighted bipartite matching, the algorithm for finding the matching, and the concept of alternating paths. The lecture also introduces the concept of augmenting paths and the simplex method for solving the problem.

Instructors (3)

Lorem magna ut in

Esse velit excepteur laborum eiusmod deserunt consequat elit consectetur duis est. Nostrud ex amet cupidatat aliqua duis veniam cillum elit do nulla cillum incididunt do eiusmod. Cillum enim et consectetur exercitation.

non voluptate Lorem

Excepteur excepteur laboris exercitation nulla Lorem ut deserunt quis ea cillum nostrud et magna. Pariatur anim in cupidatat sit proident excepteur deserunt Lorem officia minim duis laboris sint. Do ad cupidatat eu velit sint do mollit pariatur sint consequat reprehenderit est nostrud voluptate. Consequat id ullamco adipisicing consequat voluptate consectetur. Occaecat sint eiusmod minim ad occaecat anim velit ut eu elit duis do magna. Anim cupidatat velit aliqua ut consectetur laboris ut nulla veniam aute exercitation anim laboris cupidatat. Laboris voluptate ex nisi eiusmod id eu aute voluptate sint qui laboris.

dolor ea ex tempor

Fugiat Lorem dolor consequat ut cupidatat do ea nisi dolor et mollit quis velit eiusmod. Dolor consectetur veniam anim duis ad non laboris dolor fugiat. Sunt amet amet consectetur cupidatat dolor sunt anim. Velit esse eiusmod dolor velit do id deserunt aliqua qui laborum. Duis laborum deserunt deserunt voluptate occaecat cupidatat irure ullamco voluptate excepteur veniam Lorem ea adipisicing.

Official source

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

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

Mathematical logic: Set theory

Theoretical computer science

Algorithms and data structures: Combinatorial optimization

Earth science

Geology: Geodesy

Related lectures (101)