原书出处
Introduction to Algorithms, Fourth Edition
25 第25章 二分图匹配
e weight of the maximum-weight matching equals the sum of all the feasible vertex labels.
These problems—maximizing the weight of a matching and minimizing the sum of the feasible vertex labels—are “duals” of each other, in a similar vein to how the value of a maximum flow equals the capacity of a minimum
cut. Section 29.3 explores duality in more depth. Figure 25.8 Another update to the feasi
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter025.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea