原书出处
Introduction to Algorithms, Fourth Edition
25 第25章 二分图匹配
es r ∈ FR: The following lemma shows that these changes achieve the three criteria above.
Lemma 25.15 Let h be a feasible vertex labeling for the complete bipartite graph G with equality subgraph Gh, and let M be a matching for Gh and F be a breadth-first forest being constructed for the directed
equality subgraph GM,h. Then, the labeling h′ in equation (25.5) is a feasible vertex lab
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter025.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea