#5669: [with patch, needs review] New algorithm for Max Clique in Graph class
--------------------------+-------------------------------------------------
Reporter: ncohen | Owner: rlm
Type: enhancement | Status: new
Priority: minor | Milestone:
Component: graph theory | Keywords: independant set stable clique
--------------------------+-------------------------------------------------
I recently had to compute a maximum stable set in a graph with 100
vertices and ended up waiting a whole day ( to no good end ) for Sage to
compute it. The current algorithm uses the library NetworkX whose
algorithm is not nearly as efficient as Cliquer :
http://www.tkk.fi/~pat/cliquer.html
It is based on an algorithm published in 2002, and it gave me a result in
less than a millisecond ;-)
Here are the modification I made :
- I created a spkg file containing the sources of this software for it to
be available in SAGE
- I wrote the interface to use it
- I modified the Graph class to use this software instead.
- Added to the function to compute the maximum clique, I added the
function Maximum independant set ( which is a similar notion for the
complement of a graph, a bit more customary ). As the algorithm provided a
function to compute all the maximum cliques, I also added this function
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/5669>
Sage <http://sagemath.org/>
Sage - Open Source Mathematical Software: Building the Car Instead of
Reinventing the Wheel
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---
