原书出处
Introduction to Algorithms, Fourth Edition
24 第24章 最大流
ty at most min {|L|, |R|} = O(V), the value of the maximum flow in G′ is O(V). Therefore,
finding a maximum matching in a bipartite graph takes O(VE′) = O(VE) time, since |E′| = Θ(E). Exercises 24.3-1 Run the Ford-Fulkerson algorithm on the flow network in Figure 24.8(c) and show the residual
network after each flow augmentation. Number the vertices in L top to bottom from 1 to 5
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter024.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea