#17921: faster matching polynomial
-------------------------------------+-------------------------------------
Reporter: pernici | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.6
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/pernici/ticket/17921 | 29612041a35d028109e61b09bba08ea9ec1f8e5e
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by pernici):
The greedy argument to order edges in active_nodes.py orders edges in such
a way that the graph
`G_i` defined by `edges[:i]` has few nodes which have not the same degree
as in `G` (active nodes).
This leads to few `\eta_i` in the corresponding polynomial, so there are
few terms.
The greedy algorithm adds edges without increasing the number of active
nodes, if possible;
otherwise it adds a short path between two active nodes.
This algorithm can be probably improved using some
graph algorithm already in Sage, maybe an algorithm to reorder vertices
used to visualize graphs.
--
Ticket URL: <http://trac.sagemath.org/ticket/17921#comment:10>
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.
