Sciweavers

Share
CORR
2006
Springer

The Tree Inclusion Problem: In Linear Space and Faster

9 years 2 months ago
The Tree Inclusion Problem: In Linear Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been recognized as an important query primitive in XML databases. Kilpel
Philip Bille, Inge Li Gørtz
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where CORR
Authors Philip Bille, Inge Li Gørtz
Comments (0)
books