↓ Skip to main content

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

Overview of attention for article published in this source, May 2016
Altmetric Badge

Mentioned by

patent
3 patents

Readers on

mendeley
11 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Article details
Title
Efficient Anytime Anywhere Algorithms for Closeness Centrality in Large and Dynamic Graphs
Published by
Institute of Electrical and Electronics Engineers (IEEE), May 2016
DOI 10.1109/ipdpsw.2016.215
Authors

Login to access the Attention Digest and the Sentiment Analysis related to this output.

Timeline Attention over time Attention Score history
Login to access the full charts related to this output.
Activity
Login to access the full charts related to this output.
Mendeley demographics

Mendeley demographics

The data shown below were compiled from readership statistics for 11 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Login to view Mendeley reader trends over time.

Geographical breakdown

Geographical breakdown
Country Count As %
United States 1 9%
United Kingdom 1 9%
Unknown 9 82%

Demographic breakdown

Readers by professional status
Readers by professional status Count As %
Student > Ph. D. Student 4 36%
Other 2 18%
Student > Master 2 18%
Lecturer 1 9%
Researcher 1 9%
Other 0 0%
Unknown 1 9%
Readers by discipline
Readers by discipline Count As %
Computer Science 8 73%
Business, Management and Accounting 1 9%
Social Sciences 1 9%
Unknown 1 9%