原书出处
Introduction to Algorithms, Fourth Edition
第六部分 图算法
sets. Bipartite-matching problems model several situations that arise in the real world.
The chapter examines how to find a matching of maximum cardinality; the “stable-marriage problem,” which has the highly practical application of matching medical residents to hospitals; and assignment problems, which maximize the total weight of a bipartite matching.
When we characterize the running time of a graph algorithm on a given graph G = (V, E), w
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/part006.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea