原书出处
Introduction to Algorithms, Fourth Edition
24 第24章 最大流
on on the number of iterations. ▪ We can now prove the following corollary to Lemma 24.9.
Corollary 24.11 The cardinality of a maximum matching M in a bipartite graph G equals the value of a maximum flow f in its corresponding flow network G′. Proof We use the
nomenclature from Lemma 24.9. Suppose that M is a maximum matching in G and that the corr
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter024.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea