#17647: Branch and Bound for vertex separation
-------------------------+-------------------------------------------------
Reporter: | Owner:
dcoudert | Status: needs_review
Type: | Milestone: sage-6.5
enhancement | Resolution:
Priority: major | Merged in:
Component: graph | Reviewers:
theory | Work issues:
Keywords: | Commit:
Authors: David | 9aaf80ef0d8dea032d3cda04537fb8a42e1e3311
Coudert | Stopgaps:
Report Upstream: N/A |
Branch: |
public/17647 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by ncohen):
Hello David,
Here are some superficial changes. It's faster to implement them than to
write a long comment. Fix anything that you don't agree with.
I am not done with the review, but I worry a bit about the fact that you
allocate memory in a recursive function. They can cost a lot, these
things. Do you see a clean way to avoid that ?
Also, I did some profiling on your code and it seems that the most time-
consuming operations is the call to popcount. I do not know where it is
needed yet, but if you know how to work around that you would probably
earn some perf.
Tell me what you think,
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/17647#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.
