Crossmark

Efficient algorithms for updating betweenness centrality in fully dynamic graphs

Crossref DOI link: https://doi.org/10.1016/j.ins.2015.07.053

Published Print: 2016-01

Update policy: https://doi.org/10.1016/elsevier_cm_policy

Authors

Lee, Min-Joong https://orcid.org/0000-0003-2449-014X
Choi, Sunghee

Chung, Chin-Wan
License Information

Text and Data Mining valid from 2016-01-01
More Information

This article is maintained by: Elsevier

Article Title: Efficient algorithms for updating betweenness centrality in fully dynamic graphs

Journal Title: Information Sciences

CrossRef DOI link to publisher maintained version: https://doi.org/10.1016/j.ins.2015.07.053

Content Type: article

Copyright: Copyright © 2015 Elsevier Inc. All rights reserved.