Abstract
Abstract We present a local search algorithm, for upper bounding the tree-width of graphs. The algorithm exploits a new neighborhood structure that operates directly on a tree decomposition of the input graph, contrary to earlier work that generally used derived notions such as elimination orderings of the vertices. As a side result, we obtain an O ( f ( e + f ) ) -algorithm for making tree decompositions (or triangulations) minimal in terms of fill-in.
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.
