This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
We present a new parallel algorithm that extends and generalizes the traditional graph analysis metric of betweenness centrality to include additional non-shortest paths according...
In software development, resources for quality assurance are limited by time and by cost. In order to allocate resources effectively, managers need to rely on their experience bac...
—This paper presents a novel methodology for social network discovery based on the sensitivity coefficients of importance metrics, namely the Markov centrality of a node, a metr...