Abstract
Abstract Let T = ( V , E ) be a n-vertices undirected tree and X ⊂ V a set of terminal vertices. We consider the well-know multway cut problem to which we associate the problem of finding an integral multiway flow maximizing the flow routed between all pair of terminals. These problems are special cases of multicut and integral multiflow problems which are know to be NP-hard in tress. We propose a generic procedure to explore and reduce a tree, which allows to devise an O ( n ) procedure for the multiway cut and an O ( n 2 ) procwdure for the integral multiway flow in trees. Efficient procedured are also proposed to solve the problems in directed trees.
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.