#18811: Boost Clustering Coefficient
-------------------------------------+-------------------------------------
Reporter: borassi | Owner:
Type: enhancement | Status: needs_review
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 ncohen):
> I'm pretty sure you can: to intersect two neighbors, Boost algorithm
iterates over both adjacencies in time O(d_1d_2), where d_1 and d_2 are
the degrees. Using binary trees instead of vectors, you could do it in
O(d_1 log d_2), or viceversa.
Sage's timings should be approximately those of `triangle_count`.
--
Ticket URL: <http://trac.sagemath.org/ticket/18811#comment:6>
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.
