Packing odd T‐joins with at most two terminals
Abstract
Take a graph G, an edge subset , and a set of terminals where is even. The triple is called a signed graft. A T‐join is odd if it contains an odd number of edges from Σ. Let ν be the maximum number of edge‐disjoint odd T‐joins. A signature is a set of the form where and is even. Let τ be the minimum cardinality a T‐cut or a signature can achieve. Then and we say that packs if equality holds here.
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Sep 07, 2017
- Source ID
- 10.1002/jgt.22178
Entities
People
- Ahmad Abdi
- Bertrand Guenin
Organizations
- Natural Sciences and Engineering Research Council
- Office of Naval Research Global
- University of Waterloo