Binary treem-ary treedistance-based indexWiener indexBinary and m -ary trees have extensive applications, particularly in computer science and chemistry. We present exact values of all important distance-based indices for complete m -ary trees. We solve recurrence relations to obtain the value of ...
1) complete t-ary tree 完备的t叉树2) complete binary tree 完备的二叉树3) first-order theory of a complete binary tree 完全二叉树的一阶理论 1. The first-order theory of a complete binary tree is decidable by the quantifier elimination, we also know the CB rank of elements of a ...
A distribution of a given graph G is t-fold solvable if, whenever we choose any target vertex v of G, we can move t pebbles on v by using pebbling moves. T
1.Judging Fully Binary Tree on the Basis of Traversing Binary Tree;基于遍历二叉树的方法判断完全二叉树 2.A Deciding Algorithm of Full Binary Tree Completely Based on Height一种完全基于高度的满二叉树判定算法 3.The Crossing Numbers of K_m×P_n and K_(m,n)×P_l;路径与完全图,完全二分图的...
1) complete infinite-ary tree 完全无穷叉树1. Basing on the model-theoretic properties of having algebraically prime models and being simply closed for first-order theories,we present new proofs for quantifier elimination of theories of complete forked trees,including theory of complete k(k<ω)-...
1) complete k-ary tree 完全k-叉树 2) complete k-ary tree 完全k叉树 1. We considering the effect of the ratio of single moving time to single comparison time on the time consumption of Heap-sort algorithm,and by improving the standard Heap-sort algorithm,an adaptive Heap-sort algorithm ...
1) complete 5-ary tree 五元完全树 1. In this paper a estimate of the harmonious chromatic number of acomplete 5-ary treewas given. 本文给出了五元完全树的调和着色数的比较好的估计。 2) incomplete tree tuple 不完全树元组 1. , concepts of null value,incomplete tree tupleare proposed, based...
Performance Analysis of Wormhole Routed K-Ary N-Trees The past few years have seen a rise in popularity of massivelyparallel architectures that use fat-trees as their interconnectionnetworks. In this paper we ... F Petrini,M Vanneschi - 《International Journal of Foundations of Computer Science》...
中国大学MOOC: 一棵完全三叉树,下标为121的结点在第几层?(注:下标号从0开始,根的层数为0)In a complete 3-ary tree, what level is the node, whose subscript is 121, stand on?(P.S. the subscript starts form 0, and the level of root node is 0)...
一棵完全三叉树,下标为121的结点在第几层? (注:下标号从0开始,根的层数为0) In a complete 3-ary tree, what level is the node, whose subscript is 121, stand on? (P.S. the subscript starts form 0, and the level of root node is 0)