The following pages link to (Q4707790):
Displaying 9 items.
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Pushdown reachability with constant treewidth (Q1675921) (← links)
- Faster algorithms for quantitative verification in bounded treewidth graphs (Q2058390) (← links)
- The tree-width of C (Q2174562) (← links)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
- The complexity of register allocation (Q2442207) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Tree-decompositions of small pathwidth (Q5916128) (← links)
- Witnessing subsystems for probabilistic systems with low tree width (Q6649513) (← links)
