A generalized algorithm for centrality problems on trees
Journal of the ACM (JACM)
The vertex separation number of a graph equals its path-width
Information Processing Letters
Fast approximation of centrality
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Reducing the bandwidth of sparse symmetric matrices
ACM '69 Proceedings of the 1969 24th national conference
Measuring and extracting proximity in networks
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Measuring and extracting proximity graphs in networks
ACM Transactions on Knowledge Discovery from Data (TKDD)
Bridging centrality: graph mining from element level to group level
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Towards Coordination Preparedness of Soft-Target Organisation
EGOV '09 Proceedings of the 8th International Conference on Electronic Government
Influence clubs in social networks
ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume Part II
A novel measure of edge centrality in social networks
Knowledge-Based Systems
Effective graph classification based on topological and label attributes
Statistical Analysis and Data Mining
Biomine: a network-structured resource of biological entities for link prediction
Bisociative Knowledge Discovery
Interpolating between random walks and shortest paths: a path functional approach
SocInfo'12 Proceedings of the 4th international conference on Social Informatics
h-Type hybrid centrality measures for weighted networks
Scientometrics
| Hi-index | 0.00 |
We consider variations of two well-known centrality measures, betweenness and closeness, with a different model of information spread. Rather than along shortest paths only, it is assumed that information spreads efficiently like an electrical current. We prove that the current-flow variant of closeness centrality is identical with another known measure, information centrality, and give improved algorithms for computing both measures exactly. Since running times and space requirements are prohibitive for large networks, we also present a randomized approximation scheme for current-flow betweenness.