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(min(k1.45n, kn1.43))-time algorithm for the decision problem.
|Number of pages||6|
|State||Published - 1 Jan 1997|
|Event||Proceedings of the 1997 5th Israel Symposium on Theory of Computing and Systems, ISTCS - Ramat-Gan, Isr|
Duration: 17 Jun 1997 → 19 Jun 1997
|Conference||Proceedings of the 1997 5th Israel Symposium on Theory of Computing and Systems, ISTCS|
|Period||17/06/97 → 19/06/97|