CS(DAA) -Vertex cover problem

[@Harshal-dk2kr]

kya badiya bataya madam apne .....loved it😍

[@aakash6651]

Great explanation than many youtubers

[@wathson_official]

Nice Explanation!

[@ssss22144]

Great mam

[@princesoni7375]

very easy explanation ...💯💯

[@mosalibikshapathi1717]

Good explaing sum more topics explain THE SET COVERING PROBLEM

[@FARAZJAWAID-wi4vk]

great explanation

[@sanskarsolanki1221]

Helpful Video mem ❤️

[@anshumansharma6650]

Thank you so much 🥰💖

[@MdAbdullah1509]

how the degree of vertex 6 is 3???

[@ayu_shmita09]

No 2

[@Dreamyeye-shi]

Degree value of vertex 6 is 2?

[@ayu_shmita09]

Yes

[@for_you708]

exactly i was finding someone who will ask this

[@radhikak5152]

Yes

[@cromartin823]

You are golden! :)

[@santhoshinimariyala2002]

Tq

[@kpavankumar3462]

Clear mam .tq mam .explain DAA topics mam

[@avishkarkurkute4753]

Thank you mam great explanation

[@dhanush03]

Thx mam

[@vedishkabara1074]

very helpful ma'am

[@SiddaSiddaSS]

Post few more leachers I would like to have Travelling Saleman problem

[@appu9494]

Mam minor mistake....in the graph degree of 6 is 2...you wrote 3

[@santhoshinimariyala2002]

Once you check again maa

[@geekking638]

Yeah Now even I have notice it 🙂.

[@dhruvil_2662]

@@geekking638 Yes , degree of 6 is 2

[@Harshal-dk2kr]

didi apko samja na bas baat khatam

[@sampathabhishek3826]

Thank you so much maa'm

[@sushantdas1349]

good explanation. :)

[@techmoon_]

best

[@dhruvmalik8052]

nice

[@mindbodyps]

Nice mam thank you

[@shadshad3877]

thank u so much that’s very helpful . could u please solve some proof Questions? Again thank u :)

[@ranjithkatukuri513]

Mam degree of 2 was 6

[@gonnabakthulamadhavi9694]

Tq mam👍

[@gunjan3575]

If you would have chosen vertex 2 instead of 5 in second step (both the vertex had same degree), the ans wouldn't have been correct

[@sasmitshubham9424]

yeah but she was not stupid like you, one more thing was there use your common sense.

[@gautam4696]

This approach is not fully correct as it's a np complete problem , we can do this better by approximate algorithm.

[@rajendraprajapat6113]

Vertex Cover Problem is a known NP Complete problem, i.e., there is no polynomial-time solution for this unless P = NP. and you are teaching an polynomial time algorithm. How? problem in the given example: At step 2, if you select node 2 (to remove as we can take anyone according to lecture) the algorithm will give 4 vertices which is not an optimal answer. At step 2 we need to explore all possible paths(which again makes it NP ).

[@wernerheisenberg9653]

This greedy approach is wrong. e.g: If you would have selected vertex '2' instead of '5', the answer would have been 3 instead of 2. The correct approach is to find all possible subset of vertices that can form vertex cover and select the minimum size set from it.

[@yashmathur1389]

You are going greedy and this approach won't work even in your example. Let's say in your example you remove 2 instead of 5 then you would be forced to remove 2 extra nodes to cover all edges ie 1 and 5. So this time your subset would come out to be {3,2,1,5}. So Better is to check for all subsets and then find the minimum size subset which satisfies our condition.

[@NoName-xf8hy]

💩

[@sapthagiri5677]

Mam explain for tamil I am not anderstand this language

[@sapthagiri5677]

Explain in tamil