TOROSLU, İ. H. And Suleymanli, G. 2025. Efficient Parallel Algorithm for Approximating Betweenness Centrality Values of Top k Nodes in Large Graphs. Concurrency and Computation: Practice and Experience , vol.37, no.4-5 .

TOROSLU, İ. H., & Suleymanli, G., (2025). Efficient Parallel Algorithm for Approximating Betweenness Centrality Values of Top k Nodes in Large Graphs. Concurrency and Computation: Practice and Experience , vol.37, no.4-5.

TOROSLU, İSMAİL, And Gadir Suleymanli. "Efficient Parallel Algorithm for Approximating Betweenness Centrality Values of Top k Nodes in Large Graphs," Concurrency and Computation: Practice and Experience , vol.37, no.4-5, 2025

TOROSLU, İSMAİL H. And Suleymanli, Gadir. "Efficient Parallel Algorithm for Approximating Betweenness Centrality Values of Top k Nodes in Large Graphs." Concurrency and Computation: Practice and Experience , vol.37, no.4-5, 2025

TOROSLU, İ. H. And Suleymanli, G. (2025) . "Efficient Parallel Algorithm for Approximating Betweenness Centrality Values of Top k Nodes in Large Graphs." Concurrency and Computation: Practice and Experience , vol.37, no.4-5.

@article{article, author={İSMAİL HAKKI TOROSLU And author={Gadir Suleymanli}, title={Efficient Parallel Algorithm for Approximating Betweenness Centrality Values of Top k Nodes in Large Graphs}, journal={Concurrency and Computation: Practice and Experience}, year=2025}