原书出处
Introduction to Algorithms, Fourth Edition
25 第25章 二分图匹配
the queue, the queue becomes empty before the search discovers an unmatched vertex in R.
Now, let’s see why the Hungarian algorithm runs in O(n4) time, where |V| = n/2 and |E| = n2 in the original graph G. (Below we outline how to reduce the running time to O(n3).) You can go through the
pseudocode of HUNGARIAN to verify that lines 1–6 and 11 take O(n2) time. The while loop o
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter025.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea