The Tree Inclusion Problem: In Linear Space and Faster

13 years 4 months ago

Download www2.imm.dtu.dk

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

Real-time Traffic

CORR 2006 | Education | Quadratic Time | Space | Tree Inclusion Problem |

claim paper

» Faster Steiner Tree Computation in PolynomialSpace

» InclusionExclusion Branching for Partial Dominating Set and Set Splitting

» Faster Generation of Random Spanning Trees

» Fast and space efficient string kernels using suffix arrays

» Efficient Algorithms for the Tree Homeomorphism Problem

» Faster dimension reduction

» A Parallel Splitting Method for Coupled Monotone Inclusions

» Linear StateSpace Models for Blind Source Separation

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	CORR
Authors	Philip Bille, Inge Li Gørtz

Comments (0)

Sciweavers

The Tree Inclusion Problem: In Linear Space and Faster

CORR 2006 | Education | Quadratic Time | Space | Tree Inclusion Problem |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers