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

doi 10.1109/ipdps.2009.5161100
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IEEE

Related search

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

2010English

An Approximate Flow Betweenness Centrality Measure for Complex Network

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

Rain-Fall Optimization Algorithm With New Parallel Implementations

EAI Endorsed Transactions on Energy Web
ControlSystems EngineeringInformation SystemsEnergy EngineeringMarketingSustainabilityRenewable EnergyPower Technologythe Environment
2018English

Evaluating Parallel Ward Algorithm for Drug Discovery

IJCI. International Journal of Computers and Information
2015English

An Efficient Parallel Algorithm for Planarity

1986English

Figure S2: Node Betweenness Centrality (BwC) of Each Phylum

English

The Study on Evaluation of Outsize Flood Based on Flow Betweenness Centrality

2016English

An Efficient Clustering Algorithm for Spatial Datasets With Noise

International Journal of Modern Education and Computer Science
2018English

An Efficient Curve Extraction Algorithm for Massive Data

2015English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy