An n-node tree has to be explored by a group of k mobile robots deployed initially at the root. Robots traverse the edges of the tree until all nodes are visited. We would like to ...
Miroslaw Dynia, Miroslaw Korzeniowski, Christian S...
The tree isomorphism problem is the problem of determining whether two trees are isomorphic. The tree canonization problem is the problem of producing a canonical tree isomorphic t...
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
In general topology networks, routing from one node to another over a tree embedded in the network is intuitively a good strategy, since it typically results in a route length of O...
We consider the use of a static context tree for binary image compression. The contexts are stored in the leaves of a variable-depth binary tree. The tree structure itself is full...
Classification is an important data mining problem. Given a training database of records, each tagged with a class label, the goal of classification is to build a concise model ...
Johannes Gehrke, Venkatesh Ganti, Raghu Ramakrishn...
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Abstract. Trees are useful data structures, but to design efficient parallel programs over trees is known to be more difficult than to do over lists. Although several important tre...
Internet radio and television stations require significant bandwidth to support delivery of high quality audio and video streams to a large number of receivers. IP multicast is a...