原书出处
Introduction to Algorithms, Fourth Edition
24 第24章 最大流
ow network G = (V, E) is integer-valued if f (u, v) is an integer for all (u, v) ∈ V × V.
Lemma 24.9 Let G = (V, E) be a bipartite graph with vertex partition V = L ∪ R, and let G′ = (V′, E′) be its corresponding flow network. If M is a matching in G, then there is an integer-valued flow f in G′
with value |f| = |M|. Conversely, if f is an integer-valued flow in G′, then there is a m
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter024.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea