Identifying sets of key players in a network
Identifying sets of key players in a network
复制标题
DOI：
10.1109/kimas.2003.1245034
复制
发表时间：
2003-11
期刊：
影响因子：
--
通讯作者：
S. Borgatti
中科院分区：
文献类型：
--
作者：
S. Borgatti
这里考虑了两个问题：找到一组与所有其他节点最大连接的节点（KPP-Pos），以及找到一组节点，它们的移除将导致剩余网络具有最小内聚性。通过引入连通性和碎片度量来解决这些问题，并将其纳入组合优化过程。
Two problems are considered: finding a set of nodes that is maximally connected to all other nodes (KPP-Pos), and finding a set of nodes whose removal would result in a residual network of minimum cohesion. The problems are solved by the introduction of connectedness and fragmentation metrics, which are incorporated in a combinatorial optimization procedure.