New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Update Graph.clique_maximum to use MILP #11944
Comments
This comment has been minimized.
This comment has been minimized.
comment:2
Attachment: trac_11944.patch.gz 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. |
Reviewer: David Coudert |
comment:3
Hello !!! It would be, but not in this patch, as it does not do anything but asks for the "independent set algorithm" to do it. The answer, however is "YES", and much more : I interfaced some time ago an external C code for modular decomposition. With this decomposition, you obtain (given a graph) a recursive decomposition into connected components and anticonnected components (the complement of connectedcomponents). This is what we should use to first educe the graph, as this algorithm is very fast (though it will have no effect for random-looking graphs). I have had it on my todo list for a while, and right now I am actually writing the ong-awaited Gurobi interface for Sage Nathann |
comment:4
Thank you Nathann for the prompt answer. So my review for this patch is positive. |
comment:5
Thaaaaaaaaaaaanks !! Nathann |
Merged: sage-4.7.3.alpha0 |
Milestone sage-4.7.3 deleted |
Changed merged from sage-4.7.3.alpha0 to sage-4.8.alpha0 |
This begins to be a joke, but there is a third method I had forgotten in #11846 and #11928 as noticed by Peter Mueller
:-p
This patch updated clique_maximum to use the new MILP formulation of independent set !
Requires :
Apply:
Nathann
Depends on #11846
Depends on #11928
CC: @dcoudert
Component: graph theory
Author: Nathann Cohen
Reviewer: David Coudert
Merged: sage-4.8.alpha0
Issue created by migration from https://trac.sagemath.org/ticket/11944
The text was updated successfully, but these errors were encountered: