#5793: [with patch, needs review] New algorithm for Max Clique in Graph class
using Cython
--------------------------+-------------------------------------------------
Reporter: ncohen | Owner: rlm
Type: enhancement | Status: reopened
Priority: minor | Milestone: sage-4.1.1
Component: graph theory | Resolution:
Keywords: | Reviewer:
Author: | Merged:
--------------------------+-------------------------------------------------
Comment(by ncohen):
Thank you very much !! ;-)
Concerning the cliques, I agree when you say that a "A maximum clique is
just a clique of maximal size", but a "maximal clique" is a clique such
that there is no bigger clique in the graph -- according to the subset
inclusion order (all the maximal cliques of a graph need not have the same
cardinality) -- and this I what I thought I had read in the descriptions
of the others functions.
And.... now that this seems to be finished, I only have left to take care
of the LP/MIP patch, which seems quite another adventure... ;-)
Thanks again !
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/5793#comment:29>
Sage <http://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
-~----------~----~----~----~------~----~------~--~---
