原书出处
Introduction to Algorithms, Fourth Edition
25 第25章 二分图匹配
: (x, y) ∈ E for some x ∈ X}, that is, the set of vertices adjacent to some member of X.
Prove Hall’s theorem: there exists a perfect matching in G if and only if |A| ≤ |N(A)| for every subset A ⊆ L.
25.1-6 In a d-regular graph, every vertex has degree d. If G = (V, E) is bipartite with v
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter025.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea