Title :
Identifying sets of key players in a network
Author :
Borgatti, Stephen P.
Author_Institution :
Dept. of Organ. Studies, Boston Coll., Chestnut Hill, MA, USA
fDate :
30 Sept.-4 Oct. 2003
Abstract :
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.
Keywords :
graph theory; optimisation; problem solving; set theory; combinatorial optimization; connectedness metrics; fragmentation metrics; graph theory; key nodes identification; minimum cohesion; problem solving; residual network; Bleaching; Drugs; Educational institutions; Feeds; Intelligent networks; Needles; Public healthcare; Social network services; USA Councils;
Conference_Titel :
Integration of Knowledge Intensive Multi-Agent Systems, 2003. International Conference on
Print_ISBN :
0-7803-7958-6
DOI :
10.1109/KIMAS.2003.1245034
