Sangguen Kim

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
This paper implements an estimated ranking algorithm of closeness centrality measures in large-scale workflow-supported social networks. The traditional ranking algorithms for large-scale networks have suffered from the time complexity problem. The larger the network size is, the bigger dramatically the computation time becomes. To solve the problem on(More)
  • 1