Network Analysis pp 62-82

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3418) | Cite as

Algorithms for Centrality Indices

  • Riko Jacob
  • Dirk Koschützki
  • Katharina Anna Lehmann
  • Leon Peeters
  • Dagmar Tenfelde-Podehl

Abstract

The usefulness of centrality indices stands or falls with the ability to compute them quickly. This is a problem at the heart of computer science, and much research is devoted to the design and analysis of efficient algorithms. For example, shortest-path computations are well understood, and these insights are easily applicable to all distance based centrality measures. This chapter is concerned with algorithms that efficiently compute the centrality indices of the previous chapters.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Riko Jacob
    • 1
  • Dirk Koschützki
    • 2
  • Katharina Anna Lehmann
    • 3
  • Leon Peeters
    • 1
  • Dagmar Tenfelde-Podehl
    • 4
  1. 1.Theoretical Computer ScienceSwiss Federal Institute of Technology ZürichZürichSwitzerland
  2. 2.IPK GaterslebenGaterslebenGermany
  3. 3.Wilhelm-Schickard-Institut für InformatikUniversität TübingenTübingenGermany
  4. 4.Department of MathematicsTechnische Universität KaiserslauternKaiserslauternGermany

Personalised recommendations