On the public citation graph

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

0 signed · 59 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jpdc.2000.1678openalex-snapshot
Prefix Computations on Symmetric Multiprocessors
inferredcites →https://doi.org/10.1007/11945918_55openalex-snapshot
A Study on the Locality Behavior of Minimum Spanning Tree Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-77004-6_10openalex-snapshot
Approximating Betweenness Centrality
inferredcites →https://doi.org/10.1038/35075138openalex-snapshot
Lethality and centrality in protein networks
inferredcites →https://doi.org/10.1073/pnas.0407994102openalex-snapshot
The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles
inferredcites →https://doi.org/10.1080/0022250x.2001.9990249openalex-snapshot
A faster algorithm for betweenness centrality*
inferredcites →https://doi.org/10.1109/icpp.2006.57openalex-snapshot
Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks
inferredcites →https://doi.org/10.1109/ipdps.2008.4536360openalex-snapshot
Early experience with out-of-core applications on the cray XMT
inferredcites →https://doi.org/10.1126/science.286.5439.509openalex-snapshot
Emergence of Scaling in Random Networks
inferredcites →https://doi.org/10.1137/1.9781611972740.43openalex-snapshot
R-MAT: A Recursive Model for Graph Mining
inferredcites →https://doi.org/10.1142/s0129626407002843openalex-snapshot
CHALLENGES IN PARALLEL GRAPH PROCESSING
inferredcites →https://doi.org/10.1145/1242531.1242541openalex-snapshot
Evaluating the potential of multithreaded platforms for irregular scientific computations
inferredcites →https://doi.org/10.1145/971617.971643openalex-snapshot
Graph-based technologies for intelligence analysis
inferredcites →https://doi.org/10.1201/9781420011296.ch31openalex-snapshot
Design of Multithreaded Algorithms for Combinatorial Problems
inferredcites →https://doi.org/10.1201/9781584889106.ch12openalex-snapshot
Multithreaded Algorithms for Processing Massive Graphs
inferredcites →https://doi.org/10.1515/9781400841356.227openalex-snapshot
The web of human sexual contacts

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118640708.ch25openalex-snapshot
Computational Graph Analytics for Massive Streaming Data
inferred← citeshttps://doi.org/10.1007/978-1-4614-6729-8_12openalex-snapshot
Algorithms for Finding Motifs in Large Labeled Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-05411-3_5openalex-snapshot
Fast Approximated Betweenness Centrality of Directed and Weighted Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-05912-9_3openalex-snapshot
Fast Exact and Approximate Computation of Betweenness Centrality in Social Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-47955-2_24openalex-snapshot
Distributed and Parallel Algorithm for Computing Betweenness Centrality
inferred← citeshttps://doi.org/10.1007/978-3-319-50901-3_23openalex-snapshot
Clustering, Prominence and Social Network Analysis on Incomplete Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-72150-7_6openalex-snapshot
Reducing Pivots of Approximated Betweenness Computation by Hierarchically Clustering Complex Networks
inferred← citeshttps://doi.org/10.1007/978-3-662-44465-8_49openalex-snapshot
Betweenness Centrality – Incremental and Faster
inferred← citeshttps://doi.org/10.1007/bf03342028openalex-snapshot
I/O-efficient approximation of graph diameters by parallel cluster growing — a first experimental study
inferred← citeshttps://doi.org/10.1007/s11227-018-2654-5openalex-snapshot
On parallel computation of centrality measures of graphs
inferred← citeshttps://doi.org/10.1007/s41019-016-0023-zopenalex-snapshot
Distance-Aware Selective Online Query Processing Over Large Distributed Graphs
inferred← citeshttps://doi.org/10.1016/j.jpdc.2016.07.006openalex-snapshot
Exploring big graph computing — An empirical study from architectural perspective
inferred← citeshttps://doi.org/10.1016/j.parco.2015.01.003openalex-snapshot
Incremental closeness centrality in distributed memory
inferred← citeshttps://doi.org/10.1016/j.procs.2011.07.059openalex-snapshot
Towards Identifying the Challenges Associated with Emerging Large Scale Social Networks
inferred← citeshttps://doi.org/10.1016/j.procs.2013.05.203openalex-snapshot
Faster Betweenness Centrality Based on Data Structure Experimentation
inferred← citeshttps://doi.org/10.1016/j.procs.2015.11.011openalex-snapshot
Heuristic Algorithm for Approximation Betweenness Centrality Using Graph Coarsening
inferred← citeshttps://doi.org/10.1038/srep02171openalex-snapshot
Global efficiency of local immunization on complex networks
inferred← citeshttps://doi.org/10.1101/2020.08.12.20173476openalex-snapshot
Superspreading k-cores at the center of COVID-19 pandemic persistence
inferred← citeshttps://doi.org/10.1109/asonam.2018.8508323openalex-snapshot
Local Detection of Critical Nodes in Active Graphs
inferred← citeshttps://doi.org/10.1109/bigdata.2017.8258057openalex-snapshot
Two-level clustering fast betweenness centrality computation for requirement-driven approximation
inferred← citeshttps://doi.org/10.1109/bigdata.2018.8622091openalex-snapshot
Scalability Analysis of Cluster-based Betweenness Computation in Large Weighted Graphs
inferred← citeshttps://doi.org/10.1109/bigdata47090.2019.9006576openalex-snapshot
Cluster-based Computation of Exact Betweenness Centrality in Large Undirected Graphs
inferred← citeshttps://doi.org/10.1109/hipc.2018.00035openalex-snapshot
A Shared-Memory Parallel Algorithm for Updating Single-Source Shortest Paths in Large Dynamic Networks
inferred← citeshttps://doi.org/10.1109/hpec.2018.8547518openalex-snapshot
Scaling Betweenness Centrality in Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/hpec49654.2021.9622817openalex-snapshot
DMM-GAPBS: Adapting the GAP Benchmark Suite to a Distributed Memory Model
inferred← citeshttps://doi.org/10.1109/hpec49654.2021.9622864openalex-snapshot
Inverse-Deletion BFS - Revisiting Static Graph BFS Traversals with Dynamic Graph Operations
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00186openalex-snapshot
Finding Top-k Important Edges on Bipartite Graphs: Ego-betweenness Centrality-based Approaches
inferred← citeshttps://doi.org/10.1109/icsc.2014.61openalex-snapshot
MapReduce Design Patterns for Social Networking Analysis
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5161100openalex-snapshot
A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets
inferred← citeshttps://doi.org/10.1109/ipdps47924.2020.00061openalex-snapshot
Scaling Betweenness Approximation to Billions of Edges by MPI-based Adaptive Sampling
inferred← citeshttps://doi.org/10.1109/pdp55904.2022.00019openalex-snapshot
A Heuristic for Constructing Minimum Average Stretch Spanning Tree Using Betweenness Centrality
inferred← citeshttps://doi.org/10.1109/pdp62718.2024.00021openalex-snapshot
Scaling Expected Force: Efficient Identification of Key Nodes in Network-Based Epidemic Models
inferred← citeshttps://doi.org/10.1109/tmscs.2018.2797195openalex-snapshot
Multilevel Parallelism for the Exploration of Large-Scale Graphs
inferred← citeshttps://doi.org/10.1109/tpds.2012.323openalex-snapshot
GraphCT: Multithreaded Algorithms for Massive Graph Analysis
inferred← citeshttps://doi.org/10.1109/tpds.2017.2763951openalex-snapshot
Parallel Algorithm for Incremental Betweenness Centrality on Large Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611972832.76openalex-snapshot
Shattering and Compressing Networks for Betweenness Centrality
inferred← citeshttps://doi.org/10.1145/3373376.3378529openalex-snapshot
Batch-Aware Unified Memory Management in GPUs for Irregular Workloads
inferred← citeshttps://doi.org/10.1145/3581784.3607106openalex-snapshot
DGAP: Efficient Dynamic Graph Analysis on Persistent Memory
inferred← citeshttps://doi.org/10.1177/1094342011403516openalex-snapshot
The Combinatorial BLAS: design, implementation, and applications
inferred← citeshttps://doi.org/10.1177/10943420231214532openalex-snapshot
Hypergraph-based locality-enhancing methods for graph operations in Big Data applications
inferred← citeshttps://doi.org/10.1371/journal.pone.0022557openalex-snapshot
Fast Computing Betweenness Centrality with Virtual Nodes on Large Sparse Networks
inferred← citeshttps://doi.org/10.14778/2824032.2824041openalex-snapshot
Bonding vertex sets over distributed graph
inferred← citeshttps://doi.org/10.1561/1000000044openalex-snapshot
Fast Uncovering of Graph Communities on a Chip: Toward Scalable Community Detection on Multicore and Manycore Platforms
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.