Regunta, S. C., Tondomker, S. H., Shukla, K., & Kothapalli, K. (2023). Efficient parallel algorithms for dynamic closeness‐ and betweenness centrality. Concurrency and computation, 35(17), -n/a. https://doi.org/10.1002/cpe.6650
Citace podle Chicago (17th ed.)Regunta, Sai Charan, Sai Harsh Tondomker, Kshitij Shukla, a Kishore Kothapalli. "Efficient Parallel Algorithms for Dynamic Closeness‐ and Betweenness Centrality." Concurrency and Computation 35, no. 17 (2023): -n/a. https://doi.org/10.1002/cpe.6650.
Citace podle MLA (9th ed.)Regunta, Sai Charan, et al. "Efficient Parallel Algorithms for Dynamic Closeness‐ and Betweenness Centrality." Concurrency and Computation, vol. 35, no. 17, 2023, pp. -n/a, https://doi.org/10.1002/cpe.6650.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..