PROBLEM OF THE DAY : 21/01/2024 | Vertex Cover
source link: https://www.geeksforgeeks.org/videos/problem-of-the-day-21012024-vertex-cover/
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
PROBLEM OF THE DAY : 21/01/2024
Welcome to the daily solving of our PROBLEM OF THE DAY with Siddharth Hazra We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Graph but also build up problem-solving skills.
In this problem, given the Vertex cover of an undirected graph which is a list of vertices such that every vertex not in the vertex cover shares every edge with the vertices in the vertex cover. In other words, for every edge in the graph, at least one of the endpoints of the graph should belong to the vertex cover. You will be given an undirected graph G, and your task is to determine the smallest possible size of a vertex cover.
Example :
Input:
N=5
M=6
edges[][]={{1,2}
{4, 1},
{2, 4},
{3, 4},
{5, 2},
{1, 3}}
Output:
3
Explanation:
{2, 3, 4} forms a vertex cover
with the smallest size.
Give the problem a try before going through the video. All the best!!!
Problem Link: https://www.geeksforgeeks.org/problems/vertex-cover/1
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK