Flow network

A flow network is a directed capacitated graph with a source and sink. A feasible flow respects edge capacities and conserves flow at every other vertex.

Table of contents 111 2
- Max-flow min-cut theorem Flow network 85 1
  - Parametric maximum flow with one source capacity Max-flow min-cut theorem 40

 Ancestors (5)

Graph theory
Foundations of mathematics
Area of mathematics
Mathematics
 Home