Efficient extraction of high centrality vertices in distributed graphs

No abstract is available for this paper.

• Publication year

  2014

• Venue

  IEEE Conference on High Performance Extreme Computing

• Publication date

  2014-09-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/HPEC.2014.7040974
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Faster Betweenness Centrality Based on Data Structure Experimentation

  2013cited by this paper
• Identifying high betweenness centrality nodes in large social networks

  2013cited by this paper
• GPS: a graph processing system

  2013cited by this paper
• From "Think Like a Vertex" to "Think Like a Graph"

  2013cited by this paper
• Optimizations and Analysis of BSP Graph Processing Models on Public Clouds

  2013cited by this paper
• GoFFish: A Sub-graph Centric Framework for Large-Scale Graph Analytics

  2013cited by this paper
• X10-based distributed and parallel betweenness centrality and its application to social analytics

  2013cited by this paper
• Proceedings of the 2010 ACM SIGMOD International Conference on Management of data

  2010cited by this paper
• Efficient Extraction of High-Betweenness Vertices

  2010cited by this paper
• Pregel: a system for large-scale graph processing

  2010cited by this paper
• A space-efficient parallel algorithm for computing betweenness centrality in distributed memory

  2010cited by this paper
• A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets

  2009cited by this paper
• Introducing the Cray XMT

  2007cited by this paper
• Centrality Estimation in Large Networks

  2007cited by this paper
• Approximating Betweenness Centrality

  2007cited by this paper
• Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks

  2006cited by this paper
• Centrality and network flow

  2005cited by this paper
• A faster algorithm for betweenness centrality

  2001cited by this paper
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

  1998cited by this paper
• A Parallelization of Dijkstra's Shortest Path Algorithm

  1998cited by this paper
• A set of measures of centrality based upon betweenness

  1977cited by this paper

• A Distributed Spatiotemporal Contingency Analysis for the Lebanese Power Grid

  2019cites this paper
• Learning to Identify High Betweenness Centrality Nodes from Scratch: A Novel Graph Neural Network Approach

  2019cites this paper
• Novel graph processor architecture, prototype system, and results

  2016cites this paper
• Subgraph Rank: PageRank for Subgraph-Centric Distributed Graph Processing

  2014cites this paper