'Lecture 24 vertex cover' presentation slideshows

Lecture 24 Vertex Cover and Hamiltonian Cycle

Lecture 24 Vertex Cover and Hamiltonian Cycle. Vertex Cover. Given a graph G=(V,E), find a minimum subset C of vertices such that every edge is incident to a vertex in C. Decision Version. Given a graph G=(V,E) and positive integer k < |V|, is there a vertex cover C of size at most k?.

364 views • 26 slides