Faster Subtree Isomorphism

Ron Shamir*, Dekel Tsur

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


We study the subtree isomorphism problem: Given trees H and G, find a subtree of G which is isomorphic to H or decide that there is no such subtree. We give an O((k1.5/log k)n)-time algorithm for this problem, where k and n are the number of vertices in H and G, respectively. This improves over the O(k1.5n) algorithms of Chung and Matula. We also give a randomized (Las Vegas) O(k1.376n)-time algorithm for the decision problem.

Original languageEnglish
Pages (from-to)267-280
Number of pages14
JournalJournal of Algorithms
Issue number2
StatePublished - Nov 1999


Dive into the research topics of 'Faster Subtree Isomorphism'. Together they form a unique fingerprint.

Cite this