Citáce podľa APA (7th ed.)

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

Citácia podle Chicago (17th ed.)

Jamour, Fuad, Spiros Skiadopoulos, a 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.

Citácia podľa MLA (8th ed.)

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.

Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..