The height of -binary search trees.
Drmota, Michael, Prodinger, Helmut (2002)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Displaying similar documents to “Right-cancellability of a family of operations on binary trees.”
The height of -binary search trees.
Descendants and ascendants in binary trees.
Panholzer, Alois, Prodinger, Helmut (1997)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Bijective proofs of identities from colored binary trees.
Yan, Sherry H.F. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On A-Trees
Đuro Kurepa (1968)
Publications de l'Institut Mathématique
Similarity:
-trees and normalization of pseudogroups.
Rimlinger, Frank (1992)
Experimental Mathematics
Similarity:
On some hypotheses concerning trees.
D. Kurepa (1977)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
A semantic construction of two-ary integers
Gabriele Ricci (2005)
Discussiones Mathematicae - General Algebra and Applications
Similarity:
To binary trees, two-ary integers are what usual integers are to natural numbers, seen as unary trees. We can represent two-ary integers as binary trees too, yet with leaves labelled by binary words and with a structural restriction. In a sense, they are simpler than the binary trees, they relativize. Hence, contrary to the extensions known from Arithmetic and Algebra, this integer extension does not make the starting objects more complex. We use a semantic construction to get this extension....
Some remarks on the enumeration of rooted trees
Z. A. Łomnicki (1973)
Applicationes Mathematicae
Similarity:
Rigid Aronszajn Trees
Stevo Todorčević (1980)
Publications de l'Institut Mathématique
Similarity:
Deducing Properties of Trees From Their Matula Numbers
Ivan Gutman, Yeong-Nan Yeh (1993)
Publications de l'Institut Mathématique
Similarity:
Free dendriform algebras. I: A parenthesis setting.
Leroux, Philippe (2006)
International Journal of Mathematics and Mathematical Sciences
Similarity:
On the normal disconnection of a tree
A. Kośliński (1987)
Applicationes Mathematicae
Similarity:
On a matching distance between rooted phylogenetic trees
Damian Bogdanowicz, Krzysztof Giaro (2013)
International Journal of Applied Mathematics and Computer Science
Similarity:
The Robinson-Foulds (RF) distance is the most popular method of evaluating the dissimilarity between phylogenetic trees. In this paper, we define and explore in detail properties of the Matching Cluster (MC) distance, which can be regarded as a refinement of the RF metric for rooted trees. Similarly to RF, MC operates on clusters of compared trees, but the distance evaluation is more complex. Using the graph theoretic approach based on a minimum-weight perfect matching in bipartite graphs,...