Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Trac #19031: New Algorithm for Top-K Closeness Centralities
Implement the algorithm in http://arxiv.org/abs/1507.01490 for computing the k most central vertices according to closeness centrality. URL: http://trac.sagemath.org/19031 Reported by: borassi Ticket author(s): Michele Borassi Reviewer(s): David Coudert
- Loading branch information