scientific article

zbMath1038.90086MaRDI QIDQ2741347

Stan P. M. van Hoesel, Arie M. C. A. Koster, Antoon W. J. Kolen

Publication date: 23 September 2001

Full work available at URL: http://www.elsevier.nl/cas/tree/store/disc/free/endm/store/contents.htt?jrnl=disc&sctn=endm&mode=sub&vol=3

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Solving partial constraint satisfaction problems with tree decomposition ⋮ Adapting the directed grid theorem into an \textsf{FPT} algorithm ⋮ Adapting the Directed Grid Theorem into an FPT Algorithm ⋮ Computational protein design as an optimization problem ⋮ Tree decompositions of graphs: saving memory in dynamic programming ⋮ Soft arc consistency revisited

Uses Software

• CALMA

Cites Work

• Unnamed Item
• The partial constraint satisfaction problem: Facets and lifting theorems
• A tabu search algorithm for frequency assignment
• Graph minors. II. Algorithmic aspects of tree-width
• Complexity of Finding Embeddings in a k-Tree

This page was built for publication: