Pages that link to "Item:Q4443091"
From MaRDI portal
The following pages link to A New Lower Bound for Tree-Width Using Maximum Cardinality Search (Q4443091):
Displayed 6 items.
- Treewidth computations. II. Lower bounds (Q549673) (← links)
- Achievable sets, brambles, and sparse treewidth obstructions (Q881587) (← links)
- Treewidth lower bounds with brambles (Q926284) (← 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)