#18539: faster matroid 3 connectivity
-------------------------------------+-------------------------------------
       Reporter:  chaoxu             |        Owner:  chaoxu
           Type:  enhancement        |       Status:  needs_work
       Priority:  major              |    Milestone:  sage-6.8
      Component:  matroid theory     |   Resolution:
       Keywords:                     |    Merged in:
        Authors:  Chao Xu            |    Reviewers:
Report Upstream:  N/A                |  Work issues:
         Branch:                     |       Commit:
  u/chaoxu/faster_matroid_3_connectivity|  
b7cfd150951bcc47534682cf63f53eeb930dea5e
   Dependencies:                     |     Stopgaps:
-------------------------------------+-------------------------------------
Changes (by yomcat):

 * status:  needs_review => needs_work


Comment:

 Rudi changed the naive algorithm in #18429 (which I missed) to one based
 on matroid intersection. You should update names and docstrings to reflect
 that.

 I also think (but am happy to be overruled) that something like this is
 more appropriate:


 {{{
 ``None`` -- The most appropriate algorithm is chosen automatically.
 +          - ``"bridges"`` -- Bixby and Cunningham's algorithm, based on
 bridges [BC79]_. Note that this cannot return a separator.
 +          - ``"intersection"`` An algorithm based on matroid
 intersection.
 }}}

--
Ticket URL: <http://trac.sagemath.org/ticket/18539#comment:38>
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.

Reply via email to