Minimum \(T\)-cuts and optimal \(T\)-pairings
From MaRDI portal
Publication:1850005
DOI10.1016/S0012-365X(02)00397-7zbMath1007.05084OpenAlexW2034113359MaRDI QIDQ1850005
Publication date: 2 December 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00397-7
Related Items (2)
A simple minimum \(T\)-cut algorithm ⋮ Edge-connectivity augmentation of graphs over symmetric parity families
This page was built for publication: Minimum \(T\)-cuts and optimal \(T\)-pairings
