#9060: break symmetries in subgraph search
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: jason, ncohen, rlm
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.4.3
Component: graph theory | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
Description changed by ncohen:
Old description:
> Useless, when looking for a triangle, to test both abc, bca, and cab. The
> same is true when looking for Cycles, for complete graphs, etc...
>
> There may be a way to generally deal with those symmetries to improve the
> speed of subgraph search.
>
> If not, it is still possible to manually improve it for cycles, complete
> graphs, and other "common" graphs.
>
> Nathann
New description:
Useless, when looking for a triangle, to test both abc, bca, and cab. The
same is true when looking for Cycles, for complete graphs, etc...
There may be a way to generally deal with those symmetries to improve the
speed of subgraph search. Build complete table of n! symmetries if
necessary (optional argument to toggle it).
If not, it is still possible to manually improve it for cycles, complete
graphs, and other "common" graphs.
Nathann
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9060#comment:1>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
