#18746: Cutwidth of a graph
-------------------------+-------------------------------------------------
Reporter: | Owner:
dcoudert | Status: needs_review
Type: | Milestone: sage-6.8
enhancement | Resolution:
Priority: minor | Merged in:
Component: graph | Reviewers:
theory | Work issues:
Keywords: | Commit:
Authors: David | 165c0b64eeb569161e862603535e2ef2592c2229
Coudert | Stopgaps:
Report Upstream: N/A |
Branch: |
public/18746 |
Dependencies: |
-------------------------+-------------------------------------------------
Changes (by dcoudert):
* cc: ncohen (added)
* status: new => needs_review
Old description:
> This ticket implements a first method for computing the cutwidth of
> (small) graphs.
New description:
This ticket implements a first method for computing the cutwidth of
(small) graphs.
In an other ticket, I will add a MILP formulation for comparison purpose.
--
Comment:
We could certainly share more code with the `vertex_separation_exp`
methods. To do so, we should change the type `int8_t` used in
`vertex_separation_exp` to `uint8_t` which is needed for cutwidth since
the numbers are larger than for vertex separation. Let me know if I should
do such change (and certainly add a .pxd file).
--
Ticket URL: <http://trac.sagemath.org/ticket/18746#comment:3>
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.
