#17712: Adds memoization to the branch and bound for vertex separation
-------------------------+-------------------------------------------------
Reporter: | Owner:
dcoudert | Status: needs_work
Type: | Milestone: sage-6.5
enhancement | Resolution:
Priority: minor | Merged in:
Component: graph | Reviewers:
theory | Work issues:
Keywords: | Commit:
Authors: David | 4cc8d7fc0550aba5fd9e03f3263ede4172ff9b73
Coudert | Stopgaps:
Report Upstream: N/A |
Branch: |
public/17712 |
Dependencies: |
#17711 |
-------------------------+-------------------------------------------------
Comment (by dcoudert):
With this modification, the code is significantly faster. Cool! I'm really
happy to have this timing on my MBA, knowing that it is a hard instance
for this problem.
{{{
sage: from sage.graphs.graph_decompositions import vertex_separation as VS
sage: G = graphs.MycielskiGraph(6)
sage: %timeit vs, seq = VS.vertex_separation(G)
1 loops, best of 3: 965 ms per loop
}}}
We can easily change from `dict` to any other relevant data structure if
it is faster.
David.
--
Ticket URL: <http://trac.sagemath.org/ticket/17712#comment:19>
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.
