#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 | 9b5f33e7a67218dda91bed304b5f3e2f276b389b
Coudert | Stopgaps:
Report Upstream: N/A |
Branch: |
public/17647 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by dcoudert):
The {{{binary_matrix_t}}} data structure encodes the neighborhood of a
vertex using a specific bitset, that is without using the type
{{{bitset_t}}}. Consequently, it is not easy to use the operations already
implemented for {{{bitset_t}}} (union, intersection, difference, etc.)
when using {{{binary_matrix_t}}}. I would have to encapsulate the rows
into an instance of {{{bitset_t}}} before each operation. This is
certainly doable. However, I don't know how `safe` it is to cast a
{{{unsigned long *}}} into a {{{mp_limb_t*}}}. This is the main problem.
--
Ticket URL: <http://trac.sagemath.org/ticket/17647#comment:6>
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.
