The following pages link to (Q4426346):
Displayed 15 items.
- Treewidth computations. II. Lower bounds (Q549673) (← links)
- Achievable sets, brambles, and sparse treewidth obstructions (Q881587) (← links)
- Treewidth lower bounds with brambles (Q926284) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- A cubic kernel for feedback vertex set and loop cutset (Q968273) (← 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 decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth (Q2968151) (← links)
- Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization (Q3012824) (← links)
- Constructing Brambles (Q3182927) (← links)
- Encoding Treewidth into SAT (Q3637156) (← links)
- An Experimental Study of the Treewidth of Real-World Graph Data (Q5091123) (← links)
- Computing treewidth on the GPU (Q5111889) (← links)
- Heuristic and metaheuristic methods for computing graph treewidth (Q5479837) (← links)