Identifying sets of key players in a network

被引：16
作者：
Borgatti, SP [1 ]
机构：
[1] Boston Coll, Dept Org Studies, Chestnut Hill, MA 02467 USA
来源：
INTERNATIONAL CONFERENCE ON INTEGRATION OF KNOWLEDGE INTENSIVE MULTI-AGENT SYSTEMS: KIMAS'03: MODELING, EXPLORATION, AND ENGINEERING | 2003年
关键词：
D O I：
10.1109/KIMAS.2003.1245034
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Two problems are considered in this paper: 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.
引用
收藏
页码：127 / 131
页数：5
相关论文
共 14 条
12