#17921: faster matching polynomial
-----------------------+--------------------------------
Reporter: pernici | Type: enhancement
Status: new | Priority: major
Milestone: sage-6.6 | Component: graph theory
Resolution: | Report Upstream: N/A
-----------------------+--------------------------------
ADD DESCRIPTION
Added ``matching_generating_poly``, modified ``matching_polynomial``
``matching_generating_poly`` computes the matching generating polynomial
on (possibly weighted) graphs.
The algorithm (see [ButPer]) uses polynomials on nilpotent elements,
implemented in the class ``Hobj`` in matchpoly.pyx,
and a greedy argument to order edges, contained in active_nodes.py
This algorithm is faster than the Godsil algorithm on large graphs.
--
Ticket URL: <http://trac.sagemath.org/ticket/17921>
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.
