原书出处
Introduction to Algorithms, Fourth Edition
25 第25章 二分图匹配
. ▪ Thus, we have the following bound on the running time of the HOPCROFT-KARP procedure.
Theorem 25.8 The procedure HOPCROFT-KARP runs in time on an undirected bipartite graph G = (V, E). Proof By Lemma 25.7 the repeat loop iterates times, and we have seen how to implement each iteration in O(E) time.
▪ Exercises 25.1-1 Use the Hopcroft-Karp algorithm to find a maximum matching for the gra
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter025.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea