Determination of Large Families and Diameter of Equiseparable Trees
Zoran Stanić (2006)
Publications de l'Institut Mathématique
Similarity:
Displaying similar documents to “Categorification of Hopf algebras of rooted trees”
Determination of Large Families and Diameter of Equiseparable Trees
Thompson's group is not minimally almost convex.
Wladis, Claire (2007)
The New York Journal of Mathematics [electronic only]
Similarity:
Bar constructions for topological operads and the Goodwillie derivatives of the identity.
Ching, Michael (2005)
Geometry & Topology
Similarity:
On the rules for the elimination of the non-canonical Morgan trees
Damir Vukičević (2009)
Kragujevac Journal of Mathematics
Similarity:
On Catalan trees and the Jacobian conjecture.
Singer, Dan (2001)
The Electronic Journal of Combinatorics [electronic only]
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,...
Noncrossing trees and noncrossing graphs.
Chen, William Y.C., Yan, Sherry H.F. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Deducing Properties of Trees From Their Matula Numbers
Ivan Gutman, Yeong-Nan Yeh (1993)
Publications de l'Institut Mathématique
Similarity:
Splaying a search tree in preorder takes linear time.
Chaudhuri, R., Höft, H. (1991)
International Journal of Mathematics and Mathematical Sciences
Similarity:
On the structure of path-like trees
F.A. Muntaner-Batle, Miquel Rius-Font (2008)
Discussiones Mathematicae Graph Theory
Similarity:
We study the structure of path-like trees. In order to do this, we introduce a set of trees that we call expandable trees. In this paper we also generalize the concept of path-like trees and we call such generalization generalized path-like trees. As in the case of path-like trees, generalized path-like trees, have very nice labeling properties.
A new class of balanced search trees : half-balanced binary search tress
H. J. Olivié (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: