← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

25 第25章 二分图匹配

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

-cardinality matching in the equality subgraph is also a maximum-weight perfect matching.

The Hungarian algorithm repeatedly modifies the matching and the vertex labels in order to achieve this goal. The Hungarian algorithm starts with any feasible vertex labeling h and any matching M in the equality

subgraph Gh. It repeatedly finds an M-augmenting path P in Gh and, using Lemma 25.1, upda

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea