On the top-down evaluation of tree inclusion problem
by Yangjun Chen, Yibin Chen
International Journal of Information Technology, Communications and Convergence (IJITCC), Vol. 1, No. 3, 2011

Abstract: We consider the following tree-matching problem: Given labelled, ordered trees P and T, can P be obtained from T by deleting nodes. Deleting a node v entails removing all edges incident to v and, if v has a parent u, replacing the edges from u to v by edges from u to the children of v. The best known algorithm for this problem needs O('T'•'leaves(P)') time and O('leaves(P)'•min{D_T•'leaves(T)'} + 'T' + 'P') space, where leaves(T) (resp. leaves(P)) stands for the set of the leaves of T (resp. P), and D_T(resp. D_P) for the height of T (resp. P). In this paper, we present a new algorithm that requires O('T'•'leaves(P)') time but only O('T' + 'P') space.

Online publication date: Sat, 28-Feb-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information Technology, Communications and Convergence (IJITCC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com