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

• Type: Journal
• Year: 2006
• Where: CORR
• Authors: Philip Bille, Inge Li Gørtz
• Keywords: CORR 2006, Education, Quadratic Time, Space, Tree Inclusion Problem