A space-efficient parallel algorithm for computing betweenness centrality in distributed memory
Year: 2010
Type: conference-paper
Language: English
Topic: Graph Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed
Funder: Lilly Endowment
OpenAlex ID: W2131720378
