#18687: Implement the shifting algorithm for 3 and 4-connectivity
------------------------------+----------------------------
Reporter: chaoxu | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.8
Component: matroid theory | Keywords:
Merged in: | Authors:
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
------------------------------+----------------------------
Implement the fast shifting algorithm for connectivity.
It include a fast algorithm for both 3 and 4-connectivity. (the algorithms
also works for higher connectivity, but not as fast.)
The following two papers contain the idea of the algorithm:
http://www.caam.rice.edu/caam/trs/90/TR90-15.pdf
Rajan, A. (1987). Algorithmic applications of connectivity and related
topics in matroid theory. Northwestern university.
--
Ticket URL: <http://trac.sagemath.org/ticket/18687>
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.
