Computing On A Free Tree Via Complexity-Preserving Mappings

The relationship between linear lists and free trees is studied. We examine a number of well-known data structures for computing functions on linear lists and show that they can be canonically transformed into data structures for computing the ...

The LCS of two rooted, ordered, and labeled trees F and G is the largest forest that can be obtained from both trees by deleting nodes. We present algorithms for computing tree LCS which exploit the sparsity inherent to the tree LCS problem. Assuming G ...

A multiply-labeled tree (or MUL-tree) is a rooted tree in which every leaf is labeled by an element from some set $\mathcal{X}$, but in which more than one leaf may be labeled by the same element of $\mathcal{X}$. MUL-trees have applications in many fields. In ...