Skip to content

Opening book details…

Can I read Finding Good Tree Decompositions by Local Search on EtoBox?

Finding Good Tree Decompositions by Local Search by Stan van Hoesel; Bert Marchal is a Computer Science article available to read on EtoBox.

What is Finding Good Tree Decompositions by Local Search about?

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.

Who reads Finding Good Tree Decompositions by Local Search?

It is typically read by researchers, students, and practitioners in Computer Science.

Author
Stan van Hoesel; Bert Marchal
Publisher
Elsevier Science; Elsevier ; Elsevier BV; Amsterdam: Elsevier BV (ISSN 1571-0653)
Published
2009
Language
EN
Field
Computer Science (Physical Sciences)

More by Stan van Hoesel; Bert Marchal

Browse all works by Stan van Hoesel; Bert Marchal