Results 271 to 280 of about 28,178 (293)
Some of the next articles are maybe not open access.

Betweenness centrality on GPUs and heterogeneous architectures

Proceedings of the 6th Workshop on General Purpose Processor Using Graphics Processing Units, 2013
The betweenness centrality metric has always been intriguing for graph analyses and used in various applications. Yet, it is one of the most computationally expensive kernels in graph mining. In this work, we investigate a set of techniques to make the betweenness centrality computations faster on GPUs as well as on heterogeneous CPU/GPU architectures.
Ahmet Erdem Sariyüce   +3 more
openaire   +1 more source

Process-Driven Betweenness Centrality Measures

2018
In network analysis, it is often desired to determine the most central node of a network, for example, for identifying the most influential individual in a social network. Borgatti states that almost all centrality measures assume that there exists a process moving through the network from node to node (Borgatti, Soc Netw 27(1):55–71, 2005).
Mareike Bockholt, Katharina A. Zweig
openaire   +1 more source

The Mediterranean Between Centrality and Resilience

The Mediterranean has had alternating phases of geopolitical importance in history. After the pandemic and the Russian-Ukrainian crisis, its role as a basin of intra-regional relations has become even more important in allowing the states bordering it to establish a system of relations capable of making up for the crisis in mid-oceanic flows. Reshoring
openaire   +2 more sources

Identifying high betweenness centrality nodes in large social networks

Social Network Analysis and Mining, 2012
Nicolas Kourtellis   +2 more
exaly  

Finding groups with maximum betweenness centrality

Optimization Methods and Software, 2017
Alexander Veremyev   +2 more
exaly  

Efficient algorithms for game-theoretic betweenness centrality

Artificial Intelligence, 2016
Tomasz Michalak, Talal Rahwan
exaly  

Improving the Betweenness Centrality of a Node by Adding Links

Journal of Experimental Algorithmics, 2018
Gianlorenzo D'Angelo   +2 more
exaly  

Efficient algorithms for updating betweenness centrality in fully dynamic graphs

Information Sciences, 2016
Min-Joong Lee   +2 more
exaly  

Home - About - Disclaimer - Privacy