原书出处
Introduction to Algorithms, Fourth Edition
25 第25章 二分图匹配
rfect matching in an equality subgraph and an optimal solution to the assignment problem.
Theorem 25.14 Let G = (V, E), where V = L ∪ R, be a complete bipartite graph where each edge (l, r) ∈ E has weight w(l, r). Let h be a feasible vertex labeling of G and Gh be the equality subgraph of G. If
Gh contains a perfect matching M*, then M* is an optimal solution to the assignment probl
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter025.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea