DeepAI AI Chat
Log In Sign Up

A Faster Algorithm for Betweenness Centrality Based on Adjacency Matrices

by   Yelai Feng, et al.

Betweenness centrality is essential in complex network analysis; it characterizes the importance of nodes and edges in networks. It is a crucial problem that exactly computes the betweenness centrality in large networks faster, which urgently needs to be solved. We propose a novel algorithm for betweenness centrality based on the parallel computing of adjacency matrices, which is faster than the existing algorithms for large networks. The time complexity of the algorithm is only related to the number of nodes in the network, not the number of edges. Experimental evidence shows that the algorithm is effective and efficient. This novel algorithm is faster than Brandes' algorithm on small and dense networks and offers excellent solutions for betweenness centrality index computing on large-scale complex networks.


page 1

page 2

page 3

page 4


Efficient structure learning with automatic sparsity selection for causal graph processes

We propose a novel algorithm for efficiently computing a sparse directed...

A Hybrid Adjacency and Time-Based Data Structure for Analysis of Temporal Networks

Dynamic or temporal networks enable representation of time-varying edges...

Control hubs of complex networks and a polynomial-time identification algorithm

Unveiling the underlying control principles of complex networks is one o...

Entropic Spectral Learning in Large Scale Networks

We present a novel algorithm for learning the spectral density of large ...

Orthogonal Edge Routing for the EditLens

The EditLens is an interactive lens technique that supports the editing ...

QR code denoising using parallel Hopfield networks

We propose a novel algorithm for using Hopfield networks to denoise QR c...

A Vectorised Packing Algorithm for Efficient Generation of Custom Traffic Matrices

We propose a new algorithm for generating custom network traffic matrice...