@incollection{koschtzki2005centrality,
  abstract = {Centrality indices are to quantify an intuitive feeling that in most networks some vertices or edges are more central than others. Many vertex centrality indices were introduced for the first time in the 1950s: e.g., the Bavelas index [50, 51], degree centrality [483] or a first feedback centrality, introduced by Seeley [510]. These early centralities raised a rush of research in which manifold applications were found. However, not every centrality index was suitable to every application, so with time, dozens of new centrality indices were published. This chapter will present some of the more influential, ‘classic’ centrality indices. We do not strive for completeness, but hope to give a catalog of basic centrality indices with some of their main applications.},
  address = {Berlin / Heidelberg},
  affiliation = {IPK Gatersleben, Corrensstraße 3, 06466 Gatersleben, Germany},
  author = {Koschützki, Dirk and Lehmann, Katharina and Peeters, Leon and Richter, Stefan and Tenfelde-Podehl, Dagmar and Zlotowski, Oliver},
  booktitle = {Network Analysis},
  doi = {10.1007/978-3-540-31955-9_3},
  editor = {Brandes, Ulrik and Erlebach, Thomas},
  interhash = {8bfa60518049d9dbc7f6ce7b5c2914be},
  intrahash = {567d2f61b08e78af53463b2a30729830},
  isbn = {978-3-540-24979-5},
  keyword = {Computer Science},
  pages = {16-61},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Centrality Indices},
  url = {http://dx.doi.org/10.1007/978-3-540-31955-9_3},
  volume = 3418,
  year = 2005
}