#17464: Computing the automorphism group of a graph
-------------------------+-------------------------------------------------
Reporter: azi | Owner:
Type: | Status: needs_work
enhancement | Milestone: sage-6.5
Priority: major | Resolution:
Component: graph | Merged in:
theory | Reviewers:
Keywords: | Work issues:
Authors: | Commit:
Report Upstream: N/A | 1d7afae64c538d1a6a0ffdec31275a65969f2068
Branch: | Stopgaps:
public/bliss |
Dependencies: |
#17552 |
-------------------------+-------------------------------------------------
Comment (by ncohen):
{{{
sage: %timeit is_package_installed("bliss")
1000000 loops, best of 3: 1.61 µs per loop
sage: g=graphs.PetersenGraph()
sage: %timeit g.is_isomorphic(g)
1000 loops, best of 3: 171 µs per loop
sage: %timeit g.automorphism_group()
1000 loops, best of 3: 483 µs per loop
sage: %timeit g.canonical_label()
1000 loops, best of 3: 271 µs per loop
}}}
Perhaps it is not even worth that... `:-P`
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/17464#comment:48>
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.
