#18946: unweighted matroid intersection using blocking flow approach
------------------------------+----------------------------
Reporter: chaoxu | Owner:
Type: enhancement | Status: new
Priority: minor | Milestone: sage-6.8
Component: matroid theory | Keywords:
Merged in: | Authors:
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
------------------------------+----------------------------
Implement a unweighted matroid intersection algorithm that uses
O(sqrt(p)rn) independence queries by adopting a blocking flow like
technique, where r is the rank, p is the size of the maximum common
independent set.
It is a bit better than the augmenting paths algorithm, which takes O(prn)
queries. However, it's expected to perform worse when p is small, since
the constant overhead is a bit larger.
William H Cunningham. 1986. Improved bounds for matroid partition and
intersection algorithms. SIAM J. Comput. 15, 4 (November 1986), 948-957.
DOI=10.1137/0215066 http://dx.doi.org/10.1137/0215066
--
Ticket URL: <http://trac.sagemath.org/ticket/18946>
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.
