原书出处
Introduction to Algorithms, Fourth Edition
25 第25章 二分图匹配
cover. Give an algorithm to find a maximum-weight cycle cover. 25-4 Fractional matchings
It is possible to define a fractional matching. Given a graph G = (V, E), we define a fractional matching x as a function x : E → [0, 1] (real numbers between 0 and 1, inclusive) such that for every vertex u ∈ V,
we have ∑(u,v)∈E x(u, v) ≤ 1. The value of a fractional matching is ∑(u, v)∈E x(u, v). Th
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter025.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea