Abstract

We prove that the weak k-linkage problem is polynomial for every fixed k for totally i¾?-decomposable digraphs, under appropriate hypothesis on i¾?. We then apply this and recent results by Fradkin and Seymour on the weak k-linkage problem for digraphs of bounded independence number or bounded cut-width to get polynomial algorithms for some classes of digraphs like quasi-transitive digraphs, extended semicomplete digraphs, locally semicomplete digraphs all of which contain the class of semicomplete digraphs as a subclass and directed cographs.

Full Text
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

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.