#11944: Update Graph.clique_maximum to use MILP
-----------------------------+----------------------------------------------
Reporter: ncohen | Owner: tbd
Type: defect | Status: needs_info
Priority: major | Milestone: sage-4.7.3
Component: graph theory | Keywords:
Work_issues: | Upstream: N/A
Reviewer: David Coudert | Author: Nathann Cohen
Merged: | Dependencies: 11846, 11928
-----------------------------+----------------------------------------------
Changes (by dcoudert):
* status: needs_review => needs_info
* reviewer: => David Coudert
Comment:
The patch is working correctly, and the documentation is displayed
properly.
I have a question concerning the algorithms: wouldn't it be faster to
first decompose the graph into 2-connected components, and then try the
algorithm on each of them ? This could be interesting for sparse graphs.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11944#comment:2>
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.
