OpenAlex
PricingAboutJobs
Log inGet started
Work

A space-efficient parallel algorithm for computing betweenness centrality in distributed memory

HTML

Year: 2010
Type: conference-paper
Source: IEEE International Conference on High Performance Computing, Data, and Analytics
DOI: 10.1109/hipc.2010.5713180
Authors: Nick Edmonds, Torsten Hoefler, Andrew Lumsdaine
Institutions: Indiana University Bloomington, Indiana University, University of Illinois Urbana-Champaign, National Center for Supercomputing Applications
Language: English

Topic: Graph Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: betweenness centrality, parallel algorithms, distributed memory, space complexity, shortest path, coarse-grained parallelism, CRCW PRAM, social network analysis, large-scale networks

Open Access status: closed

Funder: Lilly Endowment
OpenAlex ID: W2131720378
FWCI: 4.213
Cites: 32
Cited by: 69
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security