On reconstructing of infinite forests
Jaroslav Nešetřil (1972)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Displaying similar documents to “Removal independence and multi-consensus functions”
On reconstructing of infinite forests
NP-completeness of minimal width unordered tree layout.
Marriott, Kim, Stuckey, Peter J. (2004)
Journal of Graph Algorithms and Applications
Similarity:
A non-special -tree with special -subtrees
Lajos Soukup (1990)
Commentationes Mathematicae Universitatis Carolinae
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,...
On Catalan trees and the Jacobian conjecture.
Singer, Dan (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the syntactic complexity of tree series
Symeon Bozapalidis, Antonios Kalampakas (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
We display a complexity notion based on the syntax of a tree series which yields two distinct hierarchies, one within the class of recognizable tree series and another one in the class of non-recognizable tree series.