#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 | f8e2618b7b644a6bee364379405485a5c8468418
Branch: | Stopgaps:
public/bliss |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by azi):
Did this! Also tested your example from the other day.
A workable branch is now available at public/bliss2. I am having a
mismatch trying to push it to public/bliss.
Before we change Graph.canonical_form,is_isomorphic,automorphism_group I
suggest that we address the FIXME stuff in the bliss.pyx code.
Another "issue" that is not in the code is what are we to do with the
heuristics. There are a few heuristics for bliss and we can make them as
an available choice for Sage or just go ahead with the default one.
Let me know what you think,
Jernej
Ohh, and here is your bipartite graph example:
{{{
sage: t1 = time() ; A = automorphism_group_bliss(G); t2 = time()
sage: t2-t1
0.15731596946716309
sage: t1 = time() ; A = G.automorphism_group(); t2 = time()
....... indefinitely..............
}}}
--
Ticket URL: <http://trac.sagemath.org/ticket/17464#comment:16>
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.
