Not So Easy Problems for Tree Decomposable Graphs

Abstract

We consider combinatorial problems that can be solved in polynomial time for graphs of bounded treewidth but where the order of the polynomial that bounds the running time is expected to depend on the treewidth bound. First we review some recent results for problems regarding list and equitable colorings, general factors, and generalized satisfiability. Second we establish a new hardness result for the problem of minimizing the maximum weighted outdegree for orientations of edge-weighted graphs of bounded treewidth.

Author's self-archived copy

Cited by in corpus (7)

• Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough
• Complexity and Approximability of Parameterized MAX-CSPs
• Parameterized Approximation Schemes using Graph Widths
• The Satisfactory Partition Problem
• The Harmless Set Problem
• Edge Deletion to Restrict the Size of an Epidemic
• Abstract Milling with Turn Costs