Getting Started with Competitive Programming
(an NPTEL course)
Module 3. Minimum Vertex Cover
We explore the SAM I AM problem (UVA 11419):https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2414This boils down t...
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.