3. Minimum Vertex Cover

Getting Started with Competitive Programming

(an NPTEL course)

Module 3. Minimum Vertex Cover

We explore the SAM I AM problem (UVA 11419). This boils down to finding what is called a minimum vertex cover, which is equivalent to a maximum matching, and can be found with the help of a minimum cut.

The code demonstrated in this lecture can be found here.

super-embed:<div id="hyvor-talk-view"></div><script async defer type="text/javascript" src="//talk.hyvor.com/web-api/embed.js"></script>