Sign inSign in

Cut

A partition of the vertices of a flow network into two sets, one containing the source and the other containing the sink.
as Srini Devadas defines itMITThe wording closest to all 5 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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

3

Each in their own terms, from the easiest level.

  • Erik Demaine

    MIT · Undergraduate

    An operation that removes the edge between a node v and its parent in the represented tree.
    • 40:00Dynamic Graphs I
    • 30:02Greedy Algorithms: Minimum Spanning Tree
  • Srini Devadas

    MIT · Undergraduate

    • 43:50Incremental Improvement: Max Flow, Min Cut
  • Peter Shor

    MIT · Undergraduate

    A subset of vertices containing the source s but not the sink t.
    • 6:58Max-Flow Min-Cut Theorem

Lectures that assume it

2

Connections

16

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.