#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 | 4abd2bacff0b06ae13a4fb4d046c7ecee4716d28
Coudert | Stopgaps:
Report Upstream: N/A |
Branch: |
public/17712 |
Dependencies: |
#17711 |
-------------------------+-------------------------------------------------
Comment (by ncohen):
Yo !
> You are right, we could use a set instead of a dictionary and add the
prefix `P` to the set only if `c(P)<\min_{L\in{\cal L}_P(V)} c(L)`.
Cool. This should sipmlify both code and doc.
> However, it is apparently faster to test if a frozenset is a key of a
dictionary than if it is in a set.
WHaaaaaaaaaaaaaaat ?.... `-_-`
Okay. Dict with 'True' keys. Really... `-_-`
I will write to sage-devel with your timings.
> If you agree, I will implement the changes.
+1
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/17712#comment:17>
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.
