Abstract
We give a new characterization of series-parallel graphs which implies that the maximum integer multiflow is equal to the minimum capacity multicut if G + H is series-parallel, where G + H denotes the union of the support graph G and the demand graph H . We investigate the difference between a result of the type “the cut-condition is sufficient for the existence of a multiflow in some class” and a result of the type “max-multiflow = min-multicut for some class”.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.