#13301: Implement linear time algorithm to detect path intersection
-----------------------------+----------------------------------------------
Reporter: lucaspastor | Owner: lucaspastor
Type: enhancement | Status: new
Priority: major | Milestone: sage-5.3
Component: combinatorics | Keywords:
Work issues: | Report Upstream: N/A
Reviewers: | Authors:
Merged in: | Dependencies:
Stopgaps: |
-----------------------------+----------------------------------------------
Path intersection can be detected in a fast way using the algorithm
described
in [BKP2011]. The algorithm is based on radix trees.
[BKP2011] S. Brlek, M. Koskas, X. Provençal. A linear time and space
algorithm for detecting path intersection in {{{Z^d}}}, Theorical Computer
Science 412 (2011) 4841-4850:[http://dx.doi.org/10.1016/j.tcs.2011.04.019]
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13301>
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.
