Pages that link to "Item:Q5710021"
From MaRDI portal
The following pages link to Experimental and Efficient Algorithms (Q5710021):
Displaying 11 items.
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- On the maximum cardinality search lower bound for treewidth (Q997060) (← links)
- Turbocharging treewidth heuristics (Q1725636) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- Constructing Brambles (Q3182927) (← links)
- Encoding Treewidth into SAT (Q3637156) (← links)
- Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611) (← links)
- Contraction and Treewidth Lower Bounds (Q5301380) (← links)
- Weighted Treewidth Algorithmic Techniques and Results (Q5387824) (← links)
- A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth (Q5434404) (← links)
- Algorithms – ESA 2004 (Q5464620) (← links)