Theory of linear and integer programming
Theory of linear and integer programming
Indecomposable r-graphs and some other counterexamples
Journal of Graph Theory
A simple minimum T-cut algorithm
Discrete Applied Mathematics
Hi-index | 0.05 |
We introduce the notion of T-pairing and give a min-max characterization for the minimum size of a T-cut. We show that the coefficients in the minimal TDI system for the T-cut polyhedron can be arbitrarily big.