A closeness centrality analysis algorithm for workflow-supported social networks

The purpose of this paper is to build a theoretical approach for numerically analyzing closeness centrality measures among workflow-actors of workflow-supported social network models to be formed through BPM(workflow)-driven organizational operations. The essential part of the proposed approach is a closeness centrality analysis equation to calculate each performer's closeness centrality measure on a workflow-supported social network model. In this paper, we try to develop an algorithm that is able to efficiently compute the closeness centrality analysis equation suggested from the conventional social network analysis literature, and eventually the developed algorithm will be applied to analyzing the degree of work-intimacy among those workflow-actors who are allocated to perform the corresponding workflow model.