Advertisement
Published in:
2005 | OriginalPaper | Chapter
Algorithms for Centrality Indices
Authors : Riko Jacob, Dirk Koschützki, Katharina Anna Lehmann, Leon Peeters, Dagmar Tenfelde-Podehl
Published in: Network Analysis
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.