Large-scale network analysis

MaRDI QIDQ3108696zbMATH OpenFDO

Authors David A. Bader, Christine E. Heitsch, Kamesh Madduri

Publication date 5 January 2012

zbMATH Keywords

centrality analysisfirst parallel algorithms

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• CENTRALITY ESTIMATION IN LARGE NETWORKS
• A faster algorithm for betweenness centrality*
• Network Analysis
• Approximating Betweenness Centrality
• Better approximation of betweenness centrality

Cited in

(10)

• Portal nodes screening for large scale social networks
• Ranking of network elements based on functional substructures
• A faster algorithm for betweenness centrality*
• NETAL: high-performance implementation of network analysis library considering computer memory hierarchy
• Dynamic merging of frontiers for accelerating the evaluation of betweenness centrality
• Network analysis using transitive closure: New methods for exploring networks
• Scalable Algorithms for Data and Network Analysis
• scientific article; zbMATH DE number 6604107 (Why is no real title available?)
• CENTRALITY ESTIMATION IN LARGE NETWORKS
• Multiscale analysis and data networks

This page was built for publication: Large-scale network analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3108696)