跳到内容

最小尺寸顶点分隔符

来源：R/flow.R
min_separators.Rd

查找最小尺寸的顶点集合，移除这些顶点可以将图分成更多连通分量

用法

min_separators(graph)

参数

graph

输入图。它可以是有向图，但边方向将被忽略。

值

一个数值向量列表。每个数值向量都是一个顶点分隔符。

详细信息

此函数实现了 Kanevsky 算法，用于查找无向图中所有最小尺寸的顶点分隔符。详见以下参考文献。

在具有 \(n\) 个顶点的完全连通图中，大小为 \(n-1\) 的所有子集都将作为结果列出。

参考文献

Arkady Kanevsky: Finding all minimum-size separating vertex sets in a graph. Networks 23 533–541, 1993.

JS Provan and DR Shier: A Paradigm for listing (s,t)-cuts in graphs, Algorithmica 15, 351–372, 1996.

J. Moody and D. R. White. Structural cohesion and embeddedness: A hierarchical concept of social groups. American Sociological Review, 68 103–127, Feb 2003.

参见

其他流: dominator_tree(), edge_connectivity(), is_min_separator(), is_separator(), max_flow(), min_cut(), min_st_separators(), st_cuts(), st_min_cuts(), vertex_connectivity()

minimum_size_separators().

示例

# The graph from the Moody-White paper
mw <- graph_from_literal(
  1 - 2:3:4:5:6, 2 - 3:4:5:7, 3 - 4:6:7, 4 - 5:6:7,
  5 - 6:7:21, 6 - 7, 7 - 8:11:14:19, 8 - 9:11:14, 9 - 10,
  10 - 12:13, 11 - 12:14, 12 - 16, 13 - 16, 14 - 15, 15 - 16,
  17 - 18:19:20, 18 - 20:21, 19 - 20:22:23, 20 - 21,
  21 - 22:23, 22 - 23
)

# Cohesive subgraphs
mw1 <- induced_subgraph(mw, as.character(c(1:7, 17:23)))
mw2 <- induced_subgraph(mw, as.character(7:16))
mw3 <- induced_subgraph(mw, as.character(17:23))
mw4 <- induced_subgraph(mw, as.character(c(7, 8, 11, 14)))
mw5 <- induced_subgraph(mw, as.character(1:7))

min_separators(mw)
#> [[1]]
#> + 1/23 vertex, named, from 67148fe:
#> [1] 7
#> 
min_separators(mw1)
#> [[1]]
#> + 2/14 vertices, named, from 25d187e:
#> [1] 5  19
#> 
#> [[2]]
#> + 2/14 vertices, named, from 25d187e:
#> [1] 5 7
#> 
#> [[3]]
#> + 2/14 vertices, named, from 25d187e:
#> [1] 7  21
#> 
#> [[4]]
#> + 2/14 vertices, named, from 25d187e:
#> [1] 21 19
#> 
min_separators(mw2)
#> [[1]]
#> + 2/10 vertices, named, from 25f9e9c:
#> [1] 10 16
#> 
#> [[2]]
#> + 2/10 vertices, named, from 25f9e9c:
#> [1] 14 16
#> 
#> [[3]]
#> + 2/10 vertices, named, from 25f9e9c:
#> [1] 8  10
#> 
min_separators(mw3)
#> [[1]]
#> + 2/7 vertices, named, from e255438:
#> [1] 21 19
#> 
min_separators(mw4)
#> [[1]]
#> + 3/4 vertices, named, from cd2d797:
#> [1] 8  11 14
#> 
#> [[2]]
#> + 3/4 vertices, named, from cd2d797:
#> [1] 7  11 14
#> 
#> [[3]]
#> + 3/4 vertices, named, from cd2d797:
#> [1] 7  8  14
#> 
#> [[4]]
#> + 3/4 vertices, named, from cd2d797:
#> [1] 7  8  11
#> 
min_separators(mw5)
#> [[1]]
#> + 5/7 vertices, named, from 92066e7:
#> [1] 2 3 4 5 6
#> 
#> [[2]]
#> + 5/7 vertices, named, from 92066e7:
#> [1] 1 3 4 5 7
#> 
#> [[3]]
#> + 5/7 vertices, named, from 92066e7:
#> [1] 1 2 4 6 7
#> 

# Another example, the science camp network
camp <- graph_from_literal(
  Harry:Steve:Don:Bert - Harry:Steve:Don:Bert,
  Pam:Brazey:Carol:Pat - Pam:Brazey:Carol:Pat,
  Holly - Carol:Pat:Pam:Jennie:Bill,
  Bill - Pauline:Michael:Lee:Holly,
  Pauline - Bill:Jennie:Ann,
  Jennie - Holly:Michael:Lee:Ann:Pauline,
  Michael - Bill:Jennie:Ann:Lee:John,
  Ann - Michael:Jennie:Pauline,
  Lee - Michael:Bill:Jennie,
  Gery - Pat:Steve:Russ:John,
  Russ - Steve:Bert:Gery:John,
  John - Gery:Russ:Michael
)
min_separators(camp)
#> [[1]]
#> + 2/18 vertices, named, from aed009a:
#> [1] Pat   Holly
#> 
#> [[2]]
#> + 2/18 vertices, named, from aed009a:
#> [1] Pat     Michael
#> 
#> [[3]]
#> + 2/18 vertices, named, from aed009a:
#> [1] Pat  John
#> 
#> [[4]]
#> + 2/18 vertices, named, from aed009a:
#> [1] Holly Gery 
#> 
#> [[5]]
#> + 2/18 vertices, named, from aed009a:
#> [1] Michael Gery   
#> 
#> [[6]]
#> + 2/18 vertices, named, from aed009a:
#> [1] John Gery
#> 
#> [[7]]
#> + 2/18 vertices, named, from aed009a:
#> [1] Gery Russ
#> 
#> [[8]]
#> + 2/18 vertices, named, from aed009a:
#> [1] Holly   Michael
#> 
#> [[9]]
#> + 2/18 vertices, named, from aed009a:
#> [1] Holly John 
#> 
#> [[10]]
#> + 2/18 vertices, named, from aed009a:
#> [1] Steve Bert 
#> 
#> [[11]]
#> + 2/18 vertices, named, from aed009a:
#> [1] Steve Russ 
#>