Sign inSign in

Network flow

A collection of problems associated with maximizing the amount of commodities that can push through a network with capacities.
as Erik Demaine & Srini Devadas defines itMITThe wording closest to all 4 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.

Graph theory2Algorithm1Capacity constraints1Directed graph1Graph1Linear programming1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

4

Each in their own terms, from the easiest level.

  • Srini Devadas

    MIT · Undergraduate

    A mathematical framework used to model and solve problems involving the movement of items through a network, such as matching or elimination.
    • 51:24Incremental Improvement: Matching
  • Peter Shor

    MIT · Undergraduate

    A network where each edge has a capacity, and the goal is to determine how much flow can be routed from a source to a sink.
    • 0:10Max-Flow Min-Cut Theorem
  • R. Ravi

    UC Berkeley · Research

    An assignment of a value to the arcs of a directed graph that satisfies flow conservation at each node.
    • 3:00Approximately Packing Dijoins Via Nowhere-Zero Flows

Lectures that assume it

6

Connections

18

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

4 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.