#17464: Computing the automorphism group of a graph
-------------------------+-------------------------------------------------
Reporter: azi | Owner:
Type: | Status: needs_info
enhancement | Milestone: sage-6.5
Priority: major | Resolution:
Component: graph | Merged in:
theory | Reviewers:
Keywords: | Work issues:
Authors: | Commit:
Report Upstream: N/A | f8dcb7e4ffca76715b478ada498be1714e0f38f1
Branch: | Stopgaps:
u/azi/bliss |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by azi):
Replying to [comment:7 ncohen]:
> Note: it would be cool to make bliss the default algorithm for the
computation of automorphism group <when it is available>. Some other code
call this graph automorphism code: we should of course add an optional
flag there to ask those function to use bliss, but it could also help if
it was used by default when available.
I agree ! Let me first check how this performance thing works out for
general graphs.
>
> Just in case we forget it, from time to time. 'Cause I think that this
code is really called from many obscure places in Sage.
Which code, the automorphism thing?
>
> Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/17464#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.
