Efficient batched distance and centrality computation in unweighted and weighted graphs

Keyphrases

• Weighted Graph 100%
• Distance Computation 100%
• Centrality Algorithm 100%
• Unweighted Graph 100%
• Betweenness Centrality 66%
• Batched Execution 66%
• Closeness Centrality 66%
• Common Data 33%
• Order of Magnitude 33%
• Shortest Distance 33%
• Data Access 33%
• High Cost 33%
• Multiple Distances 33%
• Distance Calculation 33%
• Random Memory Access 33%
• Analytics Systems 33%
• Centrality Measures 33%
• Graph Analytics 33%
• Common Metrics 33%
• Graph Database 33%
• Compute Accelerator 33%
• Common Graphs 33%

Computer Science

• weighted graph 100%
• Closeness Centrality 100%
• Betweenness Centrality 100%
• Building-Blocks 50%
• Data Access 50%
• Short Distance 50%
• Distance Calculation 50%
• Analytics System 50%
• Graph Analytics 50%
• Vectorization Potential 50%
• Centrality Metric 50%
• Graph Database 50%
• Random Access Memory 50%