Abstract
We present a combinatorial algorithm for the $1$-$(S,T)$-edge-connectivitxy augmentation problem in digraphs. The general $k$-$(S,T)$-edge-connectivity augmentation problem was first solved by A. Frank and T. Jordan, Minimal Edge-coverings by Pairs of Sets, Journal of Combinatorial Theory Ser. B, submitted, but their proof does not yield a polynomial-time algorithm. Our algorithm generalizes an earlier result of P. Eswaran and R. E. Tarjan and relies heavily on the nature of the special case $k = 1$.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
