Abstract
Recently R. Kosaraju gave an O(nmo.75polylog(m)) step algorithm for tree pattern matching. We improve this result by designing a simple O(n6 polylog(m)) algorithm.
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
