Efficient Anytime Anywhere Algorithms for Closeness Centrality in Large and Dynamic Graphs

Eunice E. Santos, John Korah, Vairavan Murugappan, Suresh Subramanian. Efficient Anytime Anywhere Algorithms for Closeness Centrality in Large and Dynamic Graphs. In 2016 IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPS Workshops 2016, Chicago, IL, USA, May 23-27, 2016. pages 1821-1830, IEEE Computer Society, 2016. [doi]

Abstract

Abstract is missing.