A Space-Efficient Parallel Algorithm for Computing Betweenness Centrality in Distributed Memory

doi 10.1109/hipc.2010.5713180

Full Text

Abstract

Available in

Date

Authors

Publisher

IEEE

Related search

A Faster Parallel Algorithm and Efficient Multithreaded Implementations for Evaluating Betweenness Centrality on Massive Datasets

2009English

A Novel Parallel QR Algorithm for Hybrid Distributed Memory HPC Systems

SIAM Journal of Scientific Computing
Computational MathematicsApplied Mathematics
2010English

Efficient Parallel Tree Reductions on Distributed Memory Environments

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007English

A Parallel Implementation of the Nonsymmetric QR Algorithm for Distributed Memory Architectures

SIAM Journal of Scientific Computing
Computational MathematicsApplied Mathematics
2002English

Efficient Communication for Parallel Computing

1993English

An Approximate Flow Betweenness Centrality Measure for Complex Network

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2013English

A Distributed Memory Algorithm for Lexicon Building

Journal of Parallel and Distributed Computing
Computer NetworksHardwareCommunicationsArchitectureTheoretical Computer ScienceArtificial IntelligenceSoftware
1997English

An Efficient Tasks Scheduling Algorithm for Distributed Memory Machines With Communication Delays

Information Technology Journal
2005English

Efficient Parallel Spectral Clustering Algorithm Design for Large Data Sets Under Cloud Computing Environment

Journal of Cloud Computing
Computer NetworksSoftwareCommunications
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy