Abstract
In this note we solve the edge-connectivity augmentation problem over symmetric parity families. It provides a solution for the minimum T -cut augmentation problem. We also extend a recent result of Zhang [C.Q. Zhang, Circular flows of nearly eulerian graphs and vertex splitting, J. Graph Theory 40 (2002) 147–161].
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
