In this paper we present a polynomial time algorithm for finding the shortest sequence of rotations that converts one binary tree into another when both binary trees are of a restricted form. The initial tree must be a degenerate tree, where every node has exactly one child, and the destination binary tree must also be degenerate, of a more restricted nature. Previous work on rotation distance ...

In this paper an "Augmented Binary Tree" architecture is proposed with a view to provide faulttolerance. This architecture is an augmentation of an n-level full binary tree with n redundant nodes and 2+3n-6 redundant links. The AB-tree can be configured into a full binary tree even when one node is faulty at each level. While functionally equivalent to the RAE-tree [13], the proposed AB-tree ha...

Abstract— For multi-class classification with Support Vector Machines (SVMs) a binary decision tree architecture is proposed for computational efficiency. The proposed SVMbased binary tree takes advantage of both the efficient computation of the tree architecture and the high classification accuracy of SVMs. A modified Self-Organizing Map (SOM), KSOM (Kernel-based SOM), is introduced to convert...

Let G be an edge-colored graph. A tree T in G is a proper tree if no two adjacent edges of it are assigned the same color. Let k be a fixed integer with 2 ≤ k ≤ n. For a vertex subset S ⊆ V (G) with |S| ≥ 2, a tree is called an S-tree if it connects the vertices of S in G. A k-proper coloring of G is an edge-coloring of G having the property that for every set S of k vertices of G, there exists...

This article discusses how to use queue to make non-recursion algorithm of binary link tree. As for a general binary tree, if we adopt sequence storage, firstly we should extend it first into a complete binary tree, secondly we store it to a temporary queue according to the sequence of up-down and left-right. On the basis of the properties of the complete binary tree and the queue, if we can co...

A binary-tree algorithm, Bin(n), proceeds level-bylevel from the leaves of a 2-leaf balanced binary tree to its root. This paper deals with running binary-tree algorithms on multiple bus networks (MBNs) in which processors communicate via buses. Every “binary-tree MBN” has a degree (maximum number of buses connected to a processor) of at least 2. There exists a degree-2 MBN [15] for Bin(n) that...

Parallel tree contraction is an important framework to develop efficient parallel algorithms on trees. Parallel tree contraction gives an appropriate scheduling for parallel computations on trees, and the scheduling brings efficient parallel algorithms to us. While there are many studies for efficient algorithms of parallel tree contraction and implementation of various parallel computations ba...

Weiru Liu, Xin Hong, and Kenny Adamson School of Computing and Mathematics, University of Ulster at Jordanstown, UK [email protected] Abstract. Binary join trees have been a popular structure to compute the impact of multiple belief functions initially assigned to nodes of trees or networks. Shenoy has proposed two alternative methods to transform a qualitative Markov tree into a binary tree. ...