知识卡片
二分匹配可建单位容量流网
为二分图新增源s和汇t,连s→L、原边定向L→R、R→t,所有边容量设为1。
所得网络的整数流可编码匹配。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第24章 最大流 · 查看原书依据
If the vertex partition of G is V = L ∪ R, the directed edges of G′ are the edges of E, directed from L to R, along with |V | new directed edges: E′ = {(s, u) : u ∈ L} ∪ {(u, v) : u ∈ L, v ∈ R, and (u, v) ∈ E} ∪ {(v, t) : v ∈ R}. To complete the construction, assign unit capacity to each edge in E′.
参考来源
- 位置:《算法导论(第4版)》第24章《最大流》(OEBPS/chapter024.xhtml,文本字符[45000,50000))。
- 结论依据:24.3节构造对应流网络并将每条边容量设为1。
- 原始内容:If the vertex partition of G is V = L ∪ R , the directed edges of G ′ are the edges of E , directed from L to R , along with | V | new directed edges: E ′ = {( s , u ) : u ∈ L } ∪ {( u , v ) : u ∈ L , v ∈ R , and ( u , v ) ∈ E } ∪ {( v , t ) : v ∈ R }. To complete the construction, assign unit capacity to each edge in E ′.