An Efficient Approximation of Betweenness Centrality for Uncertain Graphs
Sign Up to like & getrecommendations! Published in 2019 at "IEEE Access"
DOI: 10.1109/access.2019.2915974
Abstract: Betweenness centrality measures the centrality of nodes and edges in a graph based on the concept of shortest paths. However, such a definition is unsuitable for uncertain graphs due to the uncertainty of links. In… read more here.
Keywords: uncertain graphs; centrality; centrality uncertain; shortest paths ... See more keywords