Abstract

We present a linear time algorithm which determines whether an input graph contains K5 as aminor and outputs a K5-model if the input graph contains one. If the input graph has no K5-minor then the algorithm constructs a tree decomposition such that each node of the tree corresponds to a planar graph or a graph with eight vertices. Such a decomposition can be used to obtain algorithms to solve various optimization problems in linear time. For example, we present a linear time algorithm for finding an O(√n) seperator and a linear time algorithm for solving k-realisation on graphs without a K5-minor. Our algorithm will also be used, in a separate paper, as a key subroutine in a nearly linear time algorithm to test for the existence of an H-minor for any fixed H.

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.