Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
On the all-pairs-shortest-path problem in unweighted undirected graphs
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
On the exponent of the all pairs shortest path problem
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
Unified all-pairs shortest path algorithms in the chordal hierarchy
Discrete Applied Mathematics
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
SIAM Journal on Computing
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
Communications of the ACM
Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model
RANDOM '97 Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science
The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings
WG '94 Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science
On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
Centralities: capturing the fuzzy notion of importance in social graphs
Proceedings of the Second ACM EuroSys Workshop on Social Network Systems
Approximating betweenness centrality
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
A comparison of three algorithms for approximating the distance distribution in real-world graphs
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Centrality measures based on current flow
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Efficient processing of distance queries in large graphs: a vertex cover approach
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Betweenness centrality on GPUs and heterogeneous architectures
Proceedings of the 6th Workshop on General Purpose Processor Using Graphics Processing Units
Learning influence in complex social networks
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Incremental closeness centrality for dynamically changing social networks
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Efficient computation of the shapley value for game-theoretic network centrality
Journal of Artificial Intelligence Research
A GPU-based method for computing eigenvector centrality of gene-expression networks
AusPDC '13 Proceedings of the Eleventh Australasian Symposium on Parallel and Distributed Computing - Volume 140
| Hi-index | 0.00 |
Social studies researchers use graphs to model group activities in social networks. An important property in this context is the centrality of a vertex: the inverse of the average distance to each other vertex. We describe a randomized approximation algorithm for centrality in weighted graphs. For graphs exhibiting the small world phenomenon, our method estimates the centrality of all vertices with high probability within a (1 + ∈) factor in near-linear time.