APA (7th ed.) Citation

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

Chicago Style (17th ed.) Citation

Regunta, Sai Charan, Sai Harsh Tondomker, Kshitij Shukla, and 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.

MLA (9th ed.) Citation

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.