The following pages link to Subtree isomorphism is in random NC (Q922707):
Displaying 7 items.
- On an algorithm of Zemlyachenko for subtree isomorphism (Q294684) (← links)
- Isomorphism testing of k-trees is in NC, for fixed k (Q910212) (← links)
- Approximate labelled subtree homeomorphism (Q1018101) (← links)
- Subtree isomorphism is NC reducible to bipartite perfect matching (Q1115630) (← links)
- Sequential and parallel algorithms for embedding problems on classes of partial k-trees (Q5054759) (← links)
- The parallel complexity of tree embedding problems (extended abstract) (Q5096766) (← links)
- Finding smallest supertrees (Q6487952) (← links)