#19031: New Algorithm for Top-K Closeness Centralities
-----------------------------------------------+------------------------
Reporter: borassi | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.9
Component: graph theory | Resolution:
Keywords: Closeness Centrality, top-k | Merged in:
Authors: Michele Borassi | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: #19007,#19014 | Stopgaps:
-----------------------------------------------+------------------------
Changes (by {'newvalue': u'Michele Borassi', 'oldvalue': ''}):
* author: => Michele Borassi
* cc: ncohen, dcoudert (added)
* component: PLEASE CHANGE => graph theory
* dependencies: => #19007,#19014
* keywords: => Closeness Centrality, top-k
* type: PLEASE CHANGE => enhancement
Old description:
New description:
Implement the algorithm in http://arxiv.org/abs/1507.01490 for computing
the k most central vertices according to closeness centrality.
--
--
Ticket URL: <http://trac.sagemath.org/ticket/19031#comment:1>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
