原书出处
Introduction to Algorithms, Fourth Edition
25 第25章 二分图匹配
that after each iteration of the repeat loop, the length of an augmenting path increases.
Lemma 25.5 Let G = (V, E) be an undirected bipartite graph with matching M, and let q be the length of a shortest M-augmenting path. Let P = {P1, P2,
… , Pk} be a maximal set of vertex-disjoint M-augmenting paths of length q. Let M′ = M ⊕
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter025.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea