知识卡片

普通读书笔记卡 · 3646.e.2

全局最小割不指定源汇

理解等级:中级

原书问题中的无权无向图或多重图,全局割把顶点划成两个非空集合,以跨割边数为割值;全局最小割在所有划分中取最小,不指定源汇。

若推广到带权图,须另行定义边权或容量。

这张卡片看不懂?

已有反馈 · 0 / 10 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • 第24章 最大流 · 查看原书依据

      A global cut in an undirected graph G = (V, E) is a partition (see page 1156) of V into two nonempty sets V1 and V2. This definition is like the definition of cut that we have used in this chapter, except that we no longer have distinguished vertices s and t. Any edge (u, v) with u ∈ V1 and v ∈ V2 is said to cross the cut.

    参考来源

    - 位置:《算法导论(第4版)》第24章《最大流》(OEBPS/chapter024.xhtml,文本字符[55000,60000))。 - 结论依据:问题24-7定义无源汇的全局割,按多重图跨割边数计值;Art_P784给出求和式。 - 原始内容:A global cut in an undirected graph G = ( V , E ) is a partition (see page 1156) of V into two nonempty sets V 1 and V 2 . This definition is like the definition of cut that we have used in this chapter, except that we no longer have distinguished vertices s and t . Any edge ( u , v ) with u ∈ V 1 and v ∈ V 2 is said to cross the cut. - 公式图核读:`_epub-src/OEBPS/images/Art_P784.jpg` 将 c(V₁,V₂) 定义为跨割端点对的 c(u,v) 之和;原文中的 c(u,v) 是多重边条数。