Bipartite Graphs and Maximum Matching

In this video, we describe bipartite graphs and maximum matching in bipartite graphs. The video describes how to reduce bipartite matching to the maximum network flow problem. Please subscribe to the channel and like the videos so that others can also benefit from this channel.
---------
This channel is part of CSEdu4All, an educational initiative that aims to make computer science education accessible to all! We believe that everyone has the right to good education, and geographical and political boundaries should not be a barrier to obtaining knowledge and information. We hope that you will join and support us in this endeavor!
---------
Help us spread computer science knowledge to everyone around the world!
Please support the channel and CSEdu4All by hitting "LIKE" and the "SUBSCRIBE" button. Your support encourages us to create more accessible computer science educational content.
Patreon: / csedu4all
GoFundMe: www.gofundme.com/f/csedu4all
---------
Find more interesting courses and videos in our website
Website: csedu4all.org/
---------
Find and Connect with us on Social Media:
Facebook: / csedu4all
Twitter: / seetharamanand
LinkedIn: / anand-seetharam-5444775a

[@anandseetharam]

I also blog on Medium medium.com/@seetharam.anand. I write on data science, AI, machine learning and computer science in general. Please FOLLOW me on Medium for more articles.I also provide FREE courses on Udemy on these topics www.udemy.com/user/anand-seetharam/. Check it out!

[@asmaayari2167]

Thank you. It is so easy to understand and very clear example!!

[@anandseetharam]

Thank you. If you like the video, please subscribe to the channel and check out the other videos in the playlist.

[@aris.konstantinidis]

Best explanation ever! Much appreciated :)

[@Aughadi]

great job thanks a lot
preparing 1 week before exams
help a lot like blessing

[@sharatnaik324]

Very well and clearly explained!!!

[@anandseetharam]

Glad you found it useful

[@amirhosseintalebi6770]

Very good, Merci.

[@viktorreichert9346]

What can we do, if the bipartate graph is weighted (for example if we set a qualifikation to do a certain job between 0 and 100), how does the net-flow-graph look than?

[@ilprincipe8094]

Thanking you Sir!

[@anandseetharam]

Glad you liked it.

[@danielnderitu5886]

I like the explanation given, thank you so much Anand.

[@qinzhu880]

Easy to understand！

[@tehreemali5065]

Please attach the link of other part video thanks

[@hackerhaddi]

what an amazing video

[@anandseetharam]

Thank you.

[@rohandevaki4349]

where is the next video for this? i dont see any playlist. , you could have added the video in the description

[@WhisperingWalnuts]

+1

[@nasarathabdulgafoor6506]

Thank you sir. Very good explanation. Simple way of explaining makes easy understanding of the topic.

[@anandseetharam]

Glad you liked it.

[@ccuuttww]

thanks

[@yashjain8057]

Please Sir take an example and explain further this topic from exam point of view

[@yashjain8057]

You have explained nicely in this video but I am not sure how to find maximum bipartite Matching .....I can't see any part 2 as you mentioned in your playlist

[@anandseetharam]

You have to use the ford-fulkerson algorithm. Here is the link. czcams.com/video/6ApyyV8RnjM/video.html

[@ccohn0]

Thank you for explaining, but please give credit to the creator of the slides you use in this video, Carl Kingford. These are from his CMSC 451 course at the University of Maryland.

[@thehattedhedgehog]

0:34 And this is the edge between you and ex 🗿🗿🗿🗿🗿

[@santhosh.d1162]

😂 nice one

[@gsriram7]

At least credit the ppt maker!