Skip to content
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

Closed
nathanncohen mannequin opened this issue Oct 21, 2011 · 10 comments
Closed

Update Graph.clique_maximum to use MILP #11944

nathanncohen mannequin opened this issue Oct 21, 2011 · 10 comments

Comments

@nathanncohen
Copy link
Mannequin

nathanncohen mannequin commented Oct 21, 2011

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

@nathanncohen nathanncohen mannequin added this to the sage-4.8 milestone Oct 21, 2011
@nathanncohen nathanncohen mannequin added the p: major / 3 label Oct 21, 2011
@nathanncohen

This comment has been minimized.

@dcoudert
Copy link
Contributor

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.

@dcoudert
Copy link
Contributor

Reviewer: David Coudert

@nathanncohen
Copy link
Mannequin Author

nathanncohen mannequin commented Oct 22, 2011

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

@dcoudert
Copy link
Contributor

comment:4

Thank you Nathann for the prompt answer.

So my review for this patch is positive.

@nathanncohen
Copy link
Mannequin Author

nathanncohen mannequin commented Oct 22, 2011

comment:5

Thaaaaaaaaaaaanks !! :-)

Nathann

@jdemeyer
Copy link

Changed dependencies from 11846, 11928 to #11846, #11928

@jdemeyer
Copy link

Merged: sage-4.7.3.alpha0

@jdemeyer
Copy link

jdemeyer commented Nov 3, 2011

Milestone sage-4.7.3 deleted

@jdemeyer jdemeyer removed this from the sage-4.8 milestone Nov 3, 2011
@jdemeyer
Copy link

jdemeyer commented Nov 3, 2011

Changed merged from sage-4.7.3.alpha0 to sage-4.8.alpha0

@jdemeyer jdemeyer added this to the sage-4.8 milestone Nov 3, 2011
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants