Abstract
Suppose G is a finite graph and let T ⊆ V ( G ) be a subset of its vertices throughout referred to as terminals . The problem MAXIMUM DISJOINT T -PATHS (MDT-P) is to find a family of maximum pairwise disjoint paths connecting pairs of terminals. MDT-P is a nontrivial extension of the maximum matching problem; the latter being equivalent to the special case T = V . We present a dual problem of minimum odd T-disconnector , an appropriate minimax theorem and an O( n 4 ) algorithm constructing optimal solutions for both primal and dual problems.
Sign-in/Register to access full text options 
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.
