The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks
Abstract
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploit properties typically observed in real-world large scale networks, such as the low average distance, high local density, and heavy-tailed power law degree distributions. We test our implementations on real datasets such as the web graph, protein-interaction networks, movie-actor and citation networks, and report impressive parallel performance for evaluation of the computationally intensive centrality metrics (betweenness and closeness centrality) on high-end shared memory symmetric multiprocessor and multithreaded architectures. To our knowledge, these are the first parallel implementations of these widely-used social network analysis metrics. We demonstrate that it is possible to rigorously analyze networks three orders of magnitude larger than instances that can be handled by existing network analysis (SNA) software packages. For instance, we compute the exact betweenness centrality value for each vertex in a large US patent citation network (3 million patents, 16 million citations) in 42 minutes on 16 processors, utilizing 20GB RAM of the IBM p5 570. Current SNA packages on the other hand cannot handle graphs with more than hundred thousand edges.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00083-9 · Cited by 2,810 · cited 1×
“These networks seem to be entirely unrelated and indeed represent quite diverse relations, but experimental studies [5, 23, 11, 36, 35] have shown that they share some common traits such as a low aver- age distance between the vertices, heavy-tailed degree distributions modeled by power laws, and…”
Background
Cited by
Accelerating Large Graph Algorithms on the GPU Using CUDA
Harish, P., & Narayanan, P. J. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-77220-0_21 · Cited by 734
The Combinatorial BLAS: design, implementation, and applications
Buluç, A., & Gilbert, J. R. (2011) · The International Journal of High Performance Computing Applications · doi:10.1177/1094342011403516 · Cited by 415
Approximating Betweenness Centrality
Bader, D. A., Kintali, S., Madduri, K., & Mihail, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-77004-6_10 · Cited by 340
Self-citation
Metadata
- Authors
- Bader, D. A., & Madduri, K.
- Venue
- 2006 International Conference on Parallel Processing (ICPP'06)
- Publisher
- IEEE
- Published
- 2006-10-24
- Pages
- 539-550
- ISSN
- 0190-3918 (ISSN-L)
- OpenAlex
- W2151187166
- Cited by
- 202
- References
- 3
- FWCI
- 15.68
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks. https://app.cochat.ai/papers/10.1109/icpp.2006.57
- The paper
- Bader, D. A., & Madduri, K. (2006). Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks. 2006 International Conference on Parallel Processing (ICPP'06). https://doi.org/10.1109/icpp.2006.57
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.