#16799: clique polynomial of a graph
-------------------------------------+-------------------------------------
Reporter: amri | Owner:
Type: enhancement | Status: needs_review
Priority: minor | Milestone: sage-6.4
Component: graph theory | Resolution:
Keywords: days60 | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
public/amri/graphs/16799-clique_poly|
757e9c7d9e11bea0cef7a8a5e1eacdfff88f5e12
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by ncohen):
I suspect that you would get a better performance by using this code,
since you want to count all cliques.
http://www.sagemath.org/doc/reference/graphs/sage/graphs/independent_sets.html
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/16799#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 unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
