Optimization and packings of T-joins and T-cuts
Let G be a graph and T an even cardinality subset of its vertices. We call (G,T) a graft. A T-join is a subgraph of G whose odd-degree vertices are precisely those in T, and a T-cut is a cut delta(S) where S contains an odd number of vertices of T. An interesting question from a combinatorial optimi...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
McGill University
2011
|
| Subjects: | |
| Online Access: | http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=104686 |