Jamour, F., Skiadopoulos, S., & Kalnis, P. (2018). Parallel Algorithm for Incremental Betweenness Centrality on Large Graphs. IEEE transactions on parallel and distributed systems, 29(3), 659-672. https://doi.org/10.1109/TPDS.2017.2763951
Chicago-Zitierstil (17. Ausg.)Jamour, Fuad, Spiros Skiadopoulos, und Panos Kalnis. "Parallel Algorithm for Incremental Betweenness Centrality on Large Graphs." IEEE Transactions on Parallel and Distributed Systems 29, no. 3 (2018): 659-672. https://doi.org/10.1109/TPDS.2017.2763951.
MLA-Zitierstil (9. Ausg.)Jamour, Fuad, et al. "Parallel Algorithm for Incremental Betweenness Centrality on Large Graphs." IEEE Transactions on Parallel and Distributed Systems, vol. 29, no. 3, 2018, pp. 659-672, https://doi.org/10.1109/TPDS.2017.2763951.