原书出处
Introduction to Algorithms, Fourth Edition
25 第25章 二分图匹配
exists, such as the default vertex labeling given by Given a feasible vertex labeling h,
the equality subgraph Gh = (V, Eh) of G consists of the same vertices as G and the subset of edges Eh = {(l, r) ∈ E : l.h + r.h = w(l, r)}. The following theorem ties together a perfect matching in an
equality subgraph and an optimal solution to the assignment problem. Theorem 25.14 Let G
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter025.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea