Results 81 to 90 of about 1,259,069 (138)
Iterative Formulas for Enumerating Binary Trees
, 1997 Enumeration is an important aspect for combinatorial properties of binary trees. Traditional solutions for enumerating binary trees are expressed by algorithms and most of them are recursive. In this paper, we give our solutions by iterative formulas for
牛島, 和夫 +2 more
core
Decompositions of Leaf-Colored Binary Trees
, 1993 Leaf-colored binary trees, with an induced integer "length," arise in biomathematics. We analyse such trees in terms of a natural bipartition of their edge set, and, extending a recent decomposition for binary trees, obtain enumerative ...
Steel, M.
core +1 more source
Thought Experiments in Graphic Design Education
, 2013 What happens when we look at graphic design education as a ‘thought experiment’? Thought Experiments in Graphic Design Education documents an international mix of experimental, reflexive and speculative projects made by students, educators and ...
Trees, Joshua, Martinez, Yvan
core +1 more source
On Defining Functions on Binary Trees 1
, 2008 Summary. This article is a continuation of an article on defining functions on trees (see [6]). In this article we develop terminology specialized for binary trees, first defining binary trees and binary grammars.
Piotr Rudnicki, Grzegorz Bancerek
core
, 2019 Binary Tree, dalam ilmu komputer, sebuah pohon biner adalah struktur data pohon di mana setiap node memiliki paling banyak dua anak, yang disebut sebagai anak kiri dan anak kanan. Definisi rekursif hanya menggunakan teori himpunan gagasan adalah bahwa (non-kosong) pohon biner adalah tiga (L, S, R), di mana L dan R adalah pohon biner atau himpunan ...
openaire +2 more sources
Iterative Formulas for Enumerating Binary Trees
Enumeration is an important aspect for combinatorial properties of binary trees. Traditional solutions for enumerating binary trees are expressed by algorithms and most of them are recursive. In this paper, we give our solutions by iterative formulas for
ウシジマ, カズオ +3 more
core
Optimal Binary Split Trees Revisited
, 1994 Binary split trees were designed for static data sets and algorithms to construct optimal binary split trees have received some attention in the literature.
David A. Spuler, D. A. Spuler
core
Generation of Valid Labeled Binary Trees
, 2003 International audienceGenerating binary trees is a well-known problem. In this paper, we add some constraints to leaves of these trees. Such trees are used in the morphing of polygons, where a polygon P is represented by a binary tree T and each angle of
Effantin, Brice
core
Communications in Binary Fat Trees
, 1995 Fat trees are built around complete b-ary trees but have processing nodes only at the leaf level and may have different branch capacities in different levels. In this paper we study the communication capabilities of binary fat trees (including the simple
Nikitas J. Dimopoulos +1 more
core