Better approximation of betweenness centrality

Proceedings of the 10th Workshop on Algorithm Engineering and Experiments and the 5th Workshop on Analytic Algorithmics and Combinatorics

Volumn , Issue , 2008, Pages 90-100

  Geisberger, Robert ^a   Sanders, Peter ^a   Schultes, Dominik ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

BETWEENNESS; BETWEENNESS CENTRALITY; DIVERSE APPLICATIONS; EXACT COMPUTATIONS; LARGER NETWORKS; NETWORK APPROXIMATION; REAL-WORLD; ROUTE PLANNING; SHORT-PATH; SOCIAL NETWORK ANALYSIS;

APPROXIMATION ALGORITHMS;

EID: 58349114641     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972887.9     Document Type: Conference Paper

References (15)

1. J. M. Anthonisse. The rash in a directed graph. Technical Report BN 9/71, Stichting Mathematisch Centrum, Amsterdam, 1971.
2. David A. Bader and Kamesh Madduri. Parallel algorithms for evaluating centrality indices in real-world networks. In ICPP, pages 539-550. IEEE Computer Society, 2006.
3. H. Bast, S. Funke, P. Sanders, and D. Schultes. Fast routing in road networks with transit nodes. Science, 316(5824):566, 2007.
4. Ulrik Brandes. A faster algorithm for betweenness centrality. Journal of Mathematical Sociology, 25(2):163-177, 2001.
5. Ulrik Brandes and Christian Pich. Centrality estimation in large networks. International Journal of Bifurcation and Chaos, to appear. special issue on Complex Networks' Structure and Dynamics.
6. CiteSeer. Scientific Literature Digital Library. http://citeseer.ist.psu. edu/, 2007.
7. DBLP. DataBase systems and Logic Programming. http://dblp.uni-trier.de/, 2007.
8. L. C. Freeman. A set of measures of centrality based on betweenness. Sociometry, 40:35-41, 1977.
9. A. Goldberg, H. Kaplan, and R. Werneck. Reach for A*: Efficient point-to-point shortest path algorithms. In Workshop on Algorithm Engineering & Experiments, pages 129-143, Miami, 2006.
10. A. B. Jaffe Hall, B. H. and M. Tratjenberg. The NBER Patent Citation Data File: Lessons, Insights and Methodological Tools. NBER Working Paper, 8498, 2001.
11. Laboratory for Web Algorithmics. http://law.dsi.unimi.it/index.php? option=com-include&Itemid=65.
12. Notre Dame CNet resources. http://www.nd.edu/~networks/.
13. M. J. Rattigan, M. Maier, and D. Jensen. Using structure indices for efficient approximation of network properties. In KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge Discovery and Data mining, pages 357-366. ACM, 2006.
14. D. Schultes and P. Sanders. Dynamic highway-node routing. In 6th Workshop on Experimental Algorithms, volume 4525 of LNCS, pages 66-79. Springer, 2007.
15. Alfonso Shimbel. Structural parameters of communi-cation networks. Bulletin of Mathematical Biophysics, 15:501-507, 1953.