Performance Analysis of an Estimated Closeness Centrality Ranking Algorithm in Large-Scale Workflow-supported Social Networks
Jawon Kim, Hyun Ahn, Kwanghoon Kim, Journal of Internet Computing and Services, Vol. 16, No. 3, pp. 71-78, Jun. 2015
10.7472/jksii.2015.16.3.71, Full Text:
Keywords: Workflow-supported Social Network, Estimated Closeness Centrality, Ranking Algorithm
Abstract
Statistics
Show / Hide Statistics
Statistics (Cumulative Counts from November 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.
Statistics (Cumulative Counts from November 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.
|
Cite this article
[APA Style]
Kim, J., Ahn, H., & Kim, K. (2015). Performance Analysis of an Estimated Closeness Centrality Ranking Algorithm in Large-Scale Workflow-supported Social Networks. Journal of Internet Computing and Services, 16(3), 71-78. DOI: 10.7472/jksii.2015.16.3.71.
[IEEE Style]
J. Kim, H. Ahn, K. Kim, "Performance Analysis of an Estimated Closeness Centrality Ranking Algorithm in Large-Scale Workflow-supported Social Networks," Journal of Internet Computing and Services, vol. 16, no. 3, pp. 71-78, 2015. DOI: 10.7472/jksii.2015.16.3.71.
[ACM Style]
Jawon Kim, Hyun Ahn, and Kwanghoon Kim. 2015. Performance Analysis of an Estimated Closeness Centrality Ranking Algorithm in Large-Scale Workflow-supported Social Networks. Journal of Internet Computing and Services, 16, 3, (2015), 71-78. DOI: 10.7472/jksii.2015.16.3.71.