Skip to main content
SpringerLink
Log in

Algorithms for Centrality Indices

  • Chapter
Network Analysis

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3418))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

  1. Theoretical Computer Science, Swiss Federal Institute of Technology Zürich, 8092, Zürich, Switzerland

    Riko Jacob & Leon Peeters

  2. IPK Gatersleben, Corrensstraße 3, 06466, Gatersleben, Germany

    Dirk Koschützki

  3. Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 14, C108, 72076, Tübingen, Germany

    Katharina Anna Lehmann

  4. Department of Mathematics, Technische Universität Kaiserslautern, 67653, Kaiserslautern, Germany

    Dagmar Tenfelde-Podehl

Authors
  1. Riko Jacob
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dirk Koschützki
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Katharina Anna Lehmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Leon Peeters
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Dagmar Tenfelde-Podehl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer & Information Science, University of Konstanz,  

    Ulrik Brandes

  2. Department of Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK

    Thomas Erlebach

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Jacob, R., Koschützki, D., Lehmann, K.A., Peeters, L., Tenfelde-Podehl, D. (2005). Algorithms for Centrality Indices. In: Brandes, U., Erlebach, T. (eds) Network Analysis. Lecture Notes in Computer Science, vol 3418. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31955-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31955-9_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24979-5

  • Online ISBN: 978-3-540-31955-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation