#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 | fdef6749dd23929f9903937a82c11e52ea7ddb28
Coudert | Stopgaps:
Report Upstream: N/A |
Branch: |
public/17647 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by ncohen):
Hello,
> I'm now using a pool of bitsets. I add to use type {{{bitset_s *}}}, but
it's working and indeed a bit faster (try with G =
graphs.MycielskiGraph(5)).
Good news !
> About changing the {{{static_dense_graph}}} structure to use directly
bitsets, should I do it in this patch or in another patch?
Could you do it in another patch, then rebase this ticket on top of it ?
This way we will not have to discuss code that will be changed afterwards.
> It's a pitty I don't have this perf top command on mac. In fact it is
not installed on my linux desktop :(
Did you try it on a linux machine ? It really tells you all you want to
know.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/17647#comment:18>
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.
