Abstract
The analysis of network’s centralities has a high-level significance for many real-world applications. The variety of game and graph theoretical approaches has a paramount purpose to formalize a relative importance of nodes in networks. In this paper we represent an algorithm for the centrality calculation in the domain of weighted networks. The given algorithm calculates network centralities for weighted graphs based on the proposed procedure of edges’ splitting. The approach is tested and illustrated based on different types of network topologies.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
