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(( k 1.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( k 1.5 n) algorithms of Chung and Matula. We also give a randomized (Las Vegas) O( k 1.376 n)-time algorithm for the decision problem.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
