#18604: Computing the matching polynomial
----------------------------+----------------------------------------------
Reporter: azi | Owner:
Type: | Status: needs_review
enhancement | Milestone: sage-duplicate/invalid/wontfix
Priority: major | Resolution:
Component: graph | Merged in:
theory | Reviewers: Vincent Delecroix
Keywords: | Work issues:
Authors: | Commit:
Report Upstream: N/A | Stopgaps:
Branch: |
Dependencies: |
----------------------------+----------------------------------------------
Comment (by azi):
In some sense it does but one would really have to be careful in designing
this properly.
You argued that on random graphs on 14 vertices is less efficient and if
we take that as our base benchmark then it may not be worth it.
In general I think it can be made in a worthwhile improvement especially
for larger graphs and provided that we use bliss or nauty.
--
Ticket URL: <http://trac.sagemath.org/ticket/18604#comment:9>
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.
