Finding good tree decompositions by local search

DOI10.1016/j.endm.2009.02.007zbMath1267.05273OpenAlexW2041922849MaRDI QIDQ2839209

Stan P. M. van Hoesel, Bert Marchal

Publication date: 4 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.02.007

zbMATH Keywords

local searchtree decompositiontree-widthalgorithmic graph theory

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Treewidth computations. I: Upper bounds

Cites Work

• Unnamed Item
• Graph minors. XIII: The disjoint paths problem
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Complexity of Finding Embeddings in a k-Tree

This page was built for publication: Finding good tree decompositions by local search