#18811: Boost Clustering Coefficient
-------------------------------------+-------------------------------------
Reporter: borassi | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.8
Component: graph theory | Resolution:
Keywords: Local clustering | Merged in:
coefficient, Boost | Reviewers:
Authors: Michele Borassi | Work issues:
Report Upstream: N/A | Commit:
Branch: | 283c61be9357902ff555843b27c0ffed6fed6ea4
u/borassi/boost_clustering_coefficient| Stopgaps:
Dependencies: 18564 |
-------------------------------------+-------------------------------------
Comment (by dcoudert):
Hello,
I have not checked the code yet.
Nathann, I have an old code using bitsets for speeding up intersection of
neighborhoods. I can update it using static dense graph and see if it is a
good competitor ;)
The idea is to compute the number of triangles incident to each edge, and
then to compute the number of triangles incident to a given vertex.
David.
--
Ticket URL: <http://trac.sagemath.org/ticket/18811#comment:9>
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.
