The following pages link to Patterns with Bounded Treewidth (Q2890220):
Displaying 7 items.
- On the parameterised complexity of string morphism problems (Q315525) (← links)
- Patterns with bounded treewidth (Q476169) (← links)
- Pattern avoidance in binary trees (Q986111) (← links)
- A note on the complexity of matching patterns with variables (Q2445237) (← links)
- Noncontiguous pattern containment in binary trees (Q2449274) (← links)
- Efficient pattern matching on graph patterns of bounded treewidth (Q2840694) (← links)
- (Q5091134) (← links)