A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Fast centrality approximation in modular networks
2009
Proceeding of the 1st ACM international workshop on Complex networks meet information & knowledge management - CNIKM '09
Measuring the centrality of nodes in real-world networks has remained an important task in the technological, social, and biological network paradigms carrying implications on their analysis and applications. Exact inference of centrality values is infeasible in large networks due to the need to solve the all-pairs shortest path problem. We introduce a framework to approximate node centralities in real-world networks that are known to exhibit modularity, i.e., the presence of dense subgraphs or
doi:10.1145/1651274.1651282
dblp:conf/cikm/ChanLL09
fatcat:6bllqdqhazha7mx7ichmppgvl4