Pages that link to "Item:Q997060"
From MaRDI portal
The following pages link to On the maximum cardinality search lower bound for treewidth (Q997060):
Displaying 7 items.
- Treewidth computations. II. Lower bounds (Q549673) (← links)
- Graph searching and a min-max theorem for tree-width (Q1325271) (← links)
- How to survive while visiting a graph (Q1962049) (← links)
- Constructing Brambles (Q3182927) (← links)
- Obtaining Optimal<i>k</i>-Cardinality Trees Fast (Q5233508) (← links)
- Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710824) (← links)