- 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.**Author:**Philip Bille, Inge Li Goertz**Publish Year:**2006**Cite as:**arXiv:cs/0608124 [cs.DS]**Comments:**Minor updates from last time**Subjects:**Data Structures and Algorithms (cs.DS)arxiv.org/abs/cs/0608124 ## (PDF) On the Tree Inclusion Problem - ResearchGate

## The tree inclusion problem - SpringerLink

## The Tree Inclusion Problem: In Optimal Space and Faster

## The Tree Inclusion Problem: In Linear Space and Faster

WEBAug 31, 2006 · In this paper we show that the

**tree inclusion problem**can be solved in space $O(n_T)$ and time: O(\min(l_Pn_T, l_Pl_T\log \log n_T + n_T, \frac{n_Pn_T}{\log n_T} + n_{T}\log n_{T})).## [PDF] On the Tree Inclusion Problem | Semantic Scholar

## The tree inclusion problem: In linear space and faster

- Some results have been removed