原书出处
Introduction to Algorithms, Fourth Edition
25 第25章 二分图匹配
depends on assigning an attribute h to each vertex. We call h the label of a vertex, and
we say that h is a feasible vertex labeling of G if l.h + r.h ≥ w(l, r) for all l ∈ L and r ∈ R.
A feasible vertex labeling always exists, such as the default vertex labeling given by Gi
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter025.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea