#7600: Vertex cover
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: rlm
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-4.3
Component: graph theory | Keywords:
Work_issues: | Author:
Upstream: N/A | Reviewer:
Merged: |
----------------------------+-----------------------------------------------
Changes (by ncohen):
* status: needs_review => needs_work
Comment:
Hello !!!!
You are right, these three are reducible to each other ! Actually, Sage
already has an algorithm for 1) and 3) through Cliquer, which is way more
efficient that LinearProgramming... I will immediately add several lines
to the patch to let it use Cliquer by default, and use LP if the users
wants it ( and this way we can control the respective values of the two
algorithms ) :-)
Thank you very much for your remark, this should speed up the algorithm
amazingly ! :-)
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7600#comment:5>
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.
