The Vertex Cover Problem: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

28 April 2023

10 April 2023

15 February 2023

  • curprev 11:2311:23, 15 February 2023‎ Admin talk contribs‎ 4,666 bytes +4,666‎ Created page with "{{DISPLAYTITLE:The Vertex Cover Problem (The Vertex Cover Problem)}} == Description == A vertex cover of a graph $G$ is a set $C$ of vertices such that every edge of $G$ has at least one endpoint in $C$. The vertex cover problem is to find a minimum-size vertex cover in a given graph $G$. == Related Problems == Subproblem: The Vertex Cover Problem, Degrees Bounded By 3 == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sort..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/The_Vertex_Cover_Problem"