Faster Subtree Isomorphism

Ron Shamir, Dekel Tsur

Research output: Contribution to journalArticlepeer-review

80 Scopus citations

Abstract

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
Volume33
Issue number2
DOIs
StatePublished - 1 Jan 1999
Externally publishedYes

Fingerprint

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

Cite this