Sign inSign in

Vertex cover

A set of vertices that intersects or meets all the edges in the graph.
as Peter Shor defines itMITThe wording closest to all 3 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Edge2Graph1Graph theory basics1Undirected graph1Vertex1Vertices1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

3

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    A subset of vertices that touch all edges of a graph.
    • 1:23Rounding LP Solutions: Minimum Vertex Cover
  • Srini Devadas

    MIT · Undergraduate

    A set of vertices in an undirected graph that includes at least one endpoint of every edge in the graph.
    • 12:48Complexity: Approximation Algorithms

Lectures that assume it

2

Connections

14

The lectures that define it or assume it, and the concepts next to it.

3 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.