#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 | d92f30f684949592f36e53e4c03c3bf73c583299
Coudert | Stopgaps:
Report Upstream: N/A |
Branch: |
public/18746 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by dcoudert):
Hello,
I have performed several modifications and I'm now using the `find_order`
method of `vertex_separation`.
I don't know how to use the templates (and I'm unable to find this in
#18395).
I agree that we can certainly speed-up method `compute_edge_cut`. The best
operation to compute the number of edges from `S+i` to `V\(S+i)` is
`count_S + degree[i] - 2*(S&g.graph[i])`, where `count_S` is the number of
edges from `S` to `V\S`. However, we don't store the number of edges from
`S` to `V\S`, so I don't know how to do this incremental process.
David.
--
Ticket URL: <http://trac.sagemath.org/ticket/18746#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.
