原书出处
Introduction to Algorithms, Fourth Edition
25 第25章 二分图匹配
o matching, it will be useful to consider the symmetric difference between two matchings.
Lemma 25.3 Let M and M* be matchings in graph G = (V, E), and consider the graph G′ = (V, E′), where E′ = M ⊕ M*. Then, G′ is a disjoint union of simple paths, simple cycles, and/or isolated vertices. The
edges in each such simple path or simple cycle alternate between M and M*. If |M*| > |M|,
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter025.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea