#14099: Adding Method for testing avoidance in posets
------------------------------------------------------+---------------------
Reporter: chrisjamesberg | Owner: rowland
Type: enhancement | Status: new
Priority: minor | Milestone: sage-5.7
Component: combinatorics | Resolution:
Keywords: posets | Work issues:
Report Upstream: N/A | Reviewers: saliola
Authors: chrisjamesberg, rowland, ahmorales | Merged in:
Dependencies: | Stopgaps:
------------------------------------------------------+---------------------
Comment (by ncohen):
> Is the transitive closure + subgraph_search fast enough to make it
worthwhile?
Well... It is sligthly smarter than what you do (it would not enumerate
all chains of length 'n' beginning with an element v, if this element v is
comparable with an element of the chain of length 'm' you already picked)
and it is implemented in Cython.
I'd say that it's definitely worth a try.
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14099#comment:5>
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?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
