All public logs

Combined display of all available logs of Algorithm Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 10:23, 15 February 2023 Admin talk contribs created page The Vertex Cover Problem, Degrees Bounded By 3 (Created page with "{{DISPLAYTITLE:The Vertex Cover Problem, Degrees Bounded By 3 (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$. This version of the problem is such that the input graph $G$ has all vertices' degree bounded by 3. == Related Problems == Generalizations: The Vertex Cover...")