Login / Signup
Efficient Anytime Anywhere Algorithms for Closeness Centrality in Large and Dynamic Graphs.
Eunice E. Santos
John Korah
Vairavan Murugappan
Suresh Subramanian
Published in:
IPDPS Workshops (2016)
Keyphrases
</>
computationally efficient
computationally expensive
graph theory
theoretical analysis
computationally intensive
significant improvement
optimization problems
algorithmic solutions
data structure
search algorithm
computational complexity
highly efficient
social networks
highly scalable
computationally complex