#18539: faster matroid 3 connectivity
-------------------------------------+-------------------------------------
Reporter: chaoxu | Owner: chaoxu
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.8
Component: matroid theory | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/chaoxu/faster_matroid_3_connectivity|
84a81fdefe60c488faf9e4610c170c985e0c5f2f
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by Rudi):
Hi Chao,
I worked a bit on _minor(), a patch is in ticket #18660. Together with
#18638 and #18605 that will probably take the time needed to solve your
500x1000 binary matroid to below 1 second.
It should be possible to make your method another ~5x faster, seeing that
essentially all the work is happening in Step 2. It is possible to
eliminate all the minor-taking from that part of your method. The set of
fundamental circuits by itself is enough to detect that disconnecting
cocircuit, and so a routine which solves that problem using bitpacked
fundamental cocircuits could do all that in about the time now spent on
components(). I will perhaps write such a specialised routine once your
code is in final form, in a follow-up ticket.
Cheers,
Rudi
--
Ticket URL: <http://trac.sagemath.org/ticket/18539#comment:23>
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.
