Abstract
In PATH SET PACKING, the input is an undirected graph G, a collection $$\mathcal{P}$$ of simple paths in G, and a positive integer k. The problem is to decide whether there exist k edge-disjoint paths in $$\mathcal{P}$$ . We study the parameterized complexity of PATH SET PACKING with respect to both natural and structural parameters. We show that the problem is W[1]-hard with respect to vertex cover plus the maximum length of a path in $$\mathcal{P}$$ , and W[1]-hard with respect to pathwidth plus maximum degree plus solution size. These results answer an open question raised in [17]. On the positive side, we present an FPT algorithm parameterized by feedback vertex set plus maximum degree, and also provide an FPT algorithm parameterized by treewidth plus maximum degree plus maximum length of a path in $$\mathcal{P}$$ .
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.
