Brief overview of Vertex Cover

This is a brief overview of the famous Vertex Cover problem. I'm trying to describe these problems in very simple terminology to help other people who might be confused by some of the more formal definitions. Please let me know if these are helpful.

[@TayoEXE]

I know there a formal definitions, but why the heck can't they explain them first in simple terms?

[@bobmarleyluke]

So simple thanks, I was confused because the example I was looking at was actually wrong and didn't cover all the edges.

[@XxMonkeyACCxX]

thank you, 12 years later!

[@ArjunKumar-wk6jq]

Thanks for the simple and clear explanation :)

[@nbro5529]

The problem that you state at 0:35, that is the problem of finding the minimum vertex cover (which is a classical optimisation problem) is not NP-Complete, but "just" NP-Hard. Only the decision version of the problem is NP-Complete (NP and NP-Hard), because it is both NP (the solution can be verified in polynomial time) and NP-Hard (at least as difficult as any other problem in NP). The decision version should be something like this: "given a graph G and an integer k, is there a vertex cover of G with size at most k?".
Check Wikipedia for more info: en.wikipedia.org/wiki/Vertex_cover

[@peterpace3379]

NP-Hard (at least as the hardest, i.e., the costliest problem in NP)*

[@failsamvt]

thank you for the nice simple explanation!

[@ilovepishang]

This really helps! Thanks!

[@nandkishorenangre8244]

Simple and clear... Hats off

[@HARIVIGNESHAPBCE]

Thanks. Simple explanation

[@AnkitKumar-fn8xf]

Thanks man ..this really helped me

[@witcher_c1379]

Thanks! Very easy to understand.

[@Babelfish112]

Thanks for confirming what I thought was correct, great video :)

[@suave319]

Thanks. Audio was a bit low though

[@haoguoxuan411]

explained very clear, nice video

[@TheNerdEngineer1]

Thanks mate. More easy than complex theory.

[@VliegtuigFan]

Thanks, really helpful!

[@richatiwari4043]

Good Explanation. Thanks

[@YOURFRIENDMATHEMATICS]

Nice video. Stay connected

[@FoggyForFoody]

thx man i finally got it

[@alphabet_soup_69]

was helpful thanks!

[@nileshsolankiphotography]

Thanks!!!

[@Leon-pn6rb]

thanks from India!

[@dudeskywalker8895]

Can you put up a video explaining the NP Completeness of the Vertex Cover problem. On the lines of Clique

[@shumkis]

Thanks :)

[@animorphage]

Thanks

[@dineshpaskaran]

thx bro!

[@upperarmhumor]

thanks mate

[@FrenzyConstruct]

a 2 min video covers the same stuff as 5 pages of filler in my textbook. thanks

[@mintoo2cool]

thanks

[@jamesmeister14]

noice helped me for my exam

[@diewithmemoriesnotdreamss]

omggggg thanks

[@dhe310]

AAAAAAAAAAAAAAAWESOOOOOOOOOOOOMEE!!!

[@thomaspiechulek535]

thank you so much fuck i love you

[@funkytommyman]

and I bet the textbook cost over $100 as well.

[@Anwari70]

it was not bad but you could do better. Thanks anyway

[@marjavanderwind4251]

Even playing 2 times faster makes it still too slow

[@rayan65]

Thanks, helped a lot in short time!

[@hoomanseyfi1941]

thanks it was really helpful ;-)

[@k4621]

Thanks!

[@TheSliziak]

Thanks :)

[@shivammittal31]

Thanks

[@octaviusthird6726]

Thanks!

[@ddvidi]

Thanks!!

[@gaytheon]

Thanks!

[@jihungen]

Thanks!