← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

25 第25章 二分图匹配

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

bounds the size of a maximum matching, based on the length of a shortest augmenting path.

Lemma 25.6 Let M be a matching in graph G = (V, E), and let a shortest M-augmenting path in G contain q edges. Then the size of a maximum matching in G is at most |M| + |V| / (q + 1). Proof Let M* be a

maximum matching in G. By Lemma 25.3, G contains at least |M*| − |M| vertex-disjoint M-au

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea