Abstract
Recent results on graph minors make it desirable to have efficient algorithms, that for a fixed set of graphs {H1, ..., H c }, test whether a given graph G contains at least one graph H i as a minor. In this paper we show the following result: if at least one graph H i is a minor of a 2 × k grid graph, and at least one graph H i is a minor of a circus graph, then one can test in \(\mathcal{O}\)(n) time whether a given graph G contains at least one graph H∈{H1, ..., H c } as a minor. This result generalizes a result of Fellows and Langston. The algorithm is based on depth first search and on dynamic programming on graphs with bounded treewidth. As a corollary, it follows that the MAXIMUM LEAF SPANNING TREE problem can be solved in linear time for fixed k. We also discuss that with small modifications, an algorithm of Fellows and Langston can be modified to an algorithm that finds in \(\mathcal{O}\)(k!2 k n) time a cycle (or path) in a given graph with length≥k if it exists.
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.
