← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

25 第25章 二分图匹配

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.739Z

by k. Corollary 25.2 Let M be a matching in any undirected graph G = (V, E) and P1, P2, …

, Pk be vertex-disjoint M-augmenting paths. Then the set of edges M′ = M ⊕ (P1 ∪ P2 ∪

… ∪ Pk) is a matching in G with |M′| = |M| + k. Proof Since the M-augmenting paths P1, P2

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter025.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea