In this thesis we address the problem of computing closeness centrality, Harmonic centrality and a few related centrality measures that operate on the shortest paths in a graph. We consider sparse graphs, especially ...