Vertex Cover Problems

1.4kviews

written 6.7 years ago by

teamques10 ★ 70k

analysis of algorithms

ADD COMMENT EDIT

1 Answer

16views

written 6.7 years ago by

teamques10 ★ 70k

A vertex-cover of an undirected graph G = (V, E) is a subset of vertices V ' ⊆ V such that if edge (u, v) is an edge of G, then either u in V or v in V ' or both.

Find a vertex-cover of maximum size in a …

Create a free account to keep reading this post.

and 2 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.