#7288: Gomory-Hu Trees
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.3.4
Component: graph theory | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
Changes (by ncohen):
* status: needs_work => needs_review
Old description:
> See http://en.wikipedia.org/wiki/Gomory%E2%80%93Hu_tree. (which explains
> the algorithm used)
>
> Gomory-Hu trees are a classical decomposition of the edge connectivity of
> graphs, and this is not very long to write when one has a function for
> min-st-cut.
>
> This patch also slightly improves edge_cut and vertex_cut, which was
> needed to implement gomory_hu_tree
>
> Nathann
New description:
See http://en.wikipedia.org/wiki/Gomory%E2%80%93Hu_tree. (which explains
the algorithm used)
Gomory-Hu trees are a classical decomposition of the edge connectivity of
graphs, and this is not very long to write when one has a function for
min-st-cut.
This patch also slightly improves edge_cut and vertex_cut, which was
needed to implement gomory_hu_tree
Note : until #7311 is reviewed and merged, some exceptions will be raised
when testing the file generic_graph
Nathann
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7288#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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
