Manuscript En02-A@1 · En02-A-v1.tex · section · bb1319d5

Cut monotones and decreasing potential reachability

Cut monotones and decreasing potential reachability · lines 769–788

For a cut $X ∣ Y$ , with $Y = V ∖ X$ , define

μ_{X ∣ Y} (g) = v \in X \sum cap (v) + # {latent links crossing X ∣ Y} + # {active edges directed X \to Y},

and

σ_{X ∣ Y} (g) = # {latent links crossing X ∣ Y} + # {active edges crossing in either direction} .

All counts include identifiers and hence multiplicity.

Displayed formulas in this passage

unlabeled · line 773
$μ_{X ∣ Y} (g) = v \in X \sum cap (v) + # {latent links crossing X ∣ Y} + # {active edges directed X \to Y},$
unlabeled · line 781
$σ_{X ∣ Y} (g) = # {latent links crossing X ∣ Y} + # {active edges crossing in either direction} .$