The following pages link to (Q3798235):
Displayed 6 items.
- Constructive complexity (Q1182305) (← links)
- Improved self-reduction algorithms for graphs with bounded treewidth (Q1336622) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs (Q3656858) (← links)
- Polynomial-time self-reducibility: theoretical motivations and practical results<sup>∗</sup> (Q4009694) (← links)
- A polynomial algorithm for recognizing bounded cutwidth in hypergraphs (Q5748885) (← links)