Codex Wiki
OurBigBook.com
Site
Source code
Parametric maximum flow with one source capacity
...
Mathematics
Area of mathematics
Foundations of mathematics
Graph theory
Flow network
Max-flow min-cut theorem
OurBigBook.com
Words: 40
If one edge leaving the source has capacity
x
, every cut capacity is affine in
x
with coefficient zero or one. In the 2024 Cambridge Part IB example, cuts of capacities
x
+
5
and
14
are both sharp, giving
δ
∗
(
x
)
=
min
{
x
+
5
,
14
}
.
(50)
Ancestors
(7)
Max-flow min-cut theorem
Flow network
Graph theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(1)
Solution