Document is current

Any future updates will be listed below

Efficient algorithms for incremental all pairs shortest paths, closeness and betweenness in social network analysis

Crossref DOI link: https://doi.org/10.1007/s13278-014-0220-6

Published Online: 2014-08-03

Published Print: 2014-12

Update policy: https://doi.org/10.1007/springer_crossmark_policy

About CrossMark