Sir Very Very Good Explanation Ever On TH-cam❤❤ and i am sorry but its my request to you to use a white board or any other thing for better hand writing and presentation. Once again Sorry sir🙏
@@Pankaj_4757 yes Pankaj We are incorporating that in future However whiteboard practice has been followed in calculating complexity in recurrence relation
This is what the need of a student who is studying for tomorrow's Exam... Amazing !
sppu rocks 😂
The solution is simple like that, choose the minimum set of vertices that covers the maximum no of edges. It's simple as like that.
very straight forward , loved it!
@@adiitya5066 thank you Aditya
Kindly share
{3,1,5} and {3,2,4} both can be the correct answers i guess.
Sir please share some mcq's unitwise or share some website's link where we can practice mcq's for tomorrow's exam.
Sir Very Very Good Explanation Ever On TH-cam❤❤ and i am sorry but its my request to you to use a white board or any other thing for better hand writing and presentation. Once again Sorry sir🙏
@@Pankaj_4757 yes Pankaj
We are incorporating that in future
However whiteboard practice has been followed in calculating complexity in recurrence relation
can the answer be {1,3}? as 1 covers 2,4 and 3 covers 5,6,7
Yes I think so, it's the minimum vertex cover.
no bcz we have to cover all the edges , and if we take {1,3} then the edges between 2,5 And 5,6 will not be covered
How is this applicable in real life?… What do we use it for?
Network security, communication , research , graphs
Many applications are available for this problem