原书出处
Introduction to Algorithms, Fourth Edition
25 第25章 二分图匹配
⊕ X = Ø and X ⊕ Ø = Ø ⊕ X = X for any set X, so that the empty set is the identity for ⊕.
Lemma 25.1 Let M be a matching in any undirected graph G = (V, E), and let P be an M-augmenting path. Then the set of edges M′ = M ⊕ P is also a matching in G with |M′| = |M| + 1. Proof Let P contain q edges,
so that ⌈q/2⌉ edges belong to E − M and ⌊q/2⌋ edges belong to M, and let these q edges be
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter025.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea