Efficient anytime anywhere algorithms for closeness centrality in large and dynamic graphs

Eunice E. Santos, John Korah, Vairavan Murugappan, Suresh Subramanian

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fingerprint

Dive into the research topics of 'Efficient anytime anywhere algorithms for closeness centrality in large and dynamic graphs'. Together they form a unique fingerprint.

Engineering & Materials Science