- Preflow-Push algorithm.
- Proof that if "f" is a preflow and "h" is a compatible node labeling, then there is no "s-t" path in the augmentation graph $G_f$ defined from f.
- Details of the Preflow-Push algorithm.
- Time analysis of the Preflow-Push algorithm. Bounding the number of relabels and saturating pushes
- Bounding the number of non-saturating pushes.
- Reducing the time bound by picking the node with maximum height among the nodes with excess.