Results 51 to 60 of about 55,464 (281)
CENTRALITY MEASURES ON BRINKMANN GRAPH: BEFORE AND AFTER NODE DELETION
Barekeng, 2022 Brinkmann graph is a 4-regular graph with 21 nodes and 42 edges discovered by Gunnar Brinkmann in 1992. To our knowledge, the research specifically on Brinkmann graph is still hard to find.
Masrurotullaily Masrurotullaily
doaj +1 more source
Interlocking directorates and different power forms: An explorative analysis in the Italian context [PDF]
, 2018 The purpose of the present paper is twofold. The first is to update the contribution by Drago et al. (2011) about cross-shareholdings and interlocking directorates in Italian listed companies (FTSE MIB) to 31 December 2016 and to reinforce theory of ...
Di, Franco +2 more
core +1 more source
Distributed Current Flow Betweenness Centrality
2015 IEEE 9th International Conference on Self-Adaptive and Self-Organizing Systems, 2015 The computation of nodes centrality is of great importance for the analysis of graphs. The current flow betweenness is an interesting centrality index that is computed by considering how the information travels along all the possible paths of a graph. The current flow betweenness exploits basic results from electrical circuits, i.e.
Lulli A., Ricci L., Carlini E., Dazzi P.
openaire +2 more sources
“MedEd” on Twitter: A Social Network Analysis
Galician Medical Journal, 2023 Background. In the current era, Twitter is an increasingly popular tool for the dissemination of information as a social media voice. Social media is a valid, but underutilized, education tool at medical education institutions.
Shazia Iqbal +4 more
doaj +1 more source
A Divide-and-Conquer Algorithm for Betweenness Centrality [PDF]
, 2015 The problem of efficiently computing the betweenness centrality of nodes has been researched extensively. To date, the best known exact and centralized algorithm for this task is an algorithm proposed in 2001 by Brandes.
Bestavros, Azer +3 more
core +1 more source
Scale-free trees: the skeletons of complex networks
, 2004 We investigate the properties of the spanning trees of various real-world and model networks. The spanning tree representing the communication kernel of the original network is determined by maximizing total weight of edges, whose weights are given by ...
Dong-Hee Kim +4 more
core +1 more source
Communicability betweenness in complex networks [PDF]
, 2009 Betweenness measures provide quantitative tools to pick out fine details from the massive amount of interaction data that is available from large complex networks.
Estrada, Ernesto +2 more
core +2 more sources
The Parameterized Complexity of Centrality Improvement in Networks
, 2017 The centrality of a vertex v in a network intuitively captures how important v is for communication in the network. The task of improving the centrality of a vertex has many applications, as a higher centrality often implies a larger impact on the ...
A Boral +19 more
core +1 more source
Betweenness centrality correlation in social networks [PDF]
Physical Review E, 2003 4 pages, 4 figures, 1 ...
Goh, K. -I., Oh, E., Kahng, B., Kim, D.
openaire +3 more sources
Benchmarking Measures of Network Influence [PDF]
, 2016 Identifying key agents for the transmission of diseases (ideas, technology, etc.) across social networks has predominantly relied on measures of centrality on a static base network or a temporally flattened graph of agent interactions.
Bramson, Aaron, Vandermarliere, Benjamin
core +3 more sources