Pages that link to "Item:Q4785233"

The following pages link to Solving partial constraint satisfaction problems with tree decomposition (Q4785233):

Displaying 15 items.

• Safe separators for treewidth (Q819825) (← links)
• Treewidth computations. I: Upper bounds (Q964001) (← links)
• A comparison of problem decomposition techniques for the FAP (Q972658) (← links)
• On the maximum cardinality search lower bound for treewidth (Q997060) (← links)
• A branch-and-price-and-cut method for computing an optimal bramble (Q1751138) (← links)
• Tree decompositions of graphs: saving memory in dynamic programming (Q2465936) (← links)
• Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
• The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing (Q2661539) (← links)
• A $c^k n$ 5-Approximation Algorithm for Treewidth (Q2799353) (← links)
• Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
• D-FLAT: Declarative problem solving using tree decompositions and answer-set programming (Q4911127) (← links)
• Tree decompositions and social graphs (Q5856440) (← links)
• Models and solution techniques for frequency assignment problems (Q5920489) (← links)
• Tangle bases: Revisited (Q6087071) (← links)
• Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem (Q6114925) (← links)