The following pages link to Subtree Isomorphism Revisited (Q4554355):
Displaying 9 items.
- Subtree isomorphism is in random NC (Q922707) (← links)
- The complexity of approximate pattern matching on de Bruijn graphs (Q2170154) (← links)
- (Q4875187) (← links)
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
- Isomorphism Types of Trees (Q5329167) (← links)
- The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance (Q5874533) (← links)
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q6076352) (← links)
- Dichotomies for tree minor containment with structural parameters (Q6575410) (← links)
- Dichotomies for tree minor containment with structural parameters (Q6658295) (← links)
