Related papers: Non-binary universal tree-based networks
Between the leaves and the nodes of a complete binary tree, a separate parent-child-sister hierarchy is employed independent of the parent-child-sister hierarchy used for the rest of the tree. Two different versions of such a local…
Models of growing networks are a central topic in network science. In these models, vertices are usually labeled by their arrival time, distinguishing even those node pairs whose structural roles are identical. In contrast, unlabeled…
For every $n\in \mathbb{N}$, we present a set $S_n$ of $O(n^{3/2}\log n)$ points in the plane such that every planar 3-tree with $n$ vertices has a straight-line embedding in the plane in which the vertices are mapped to a subset of $S_n$.…
Phylogenetic networks provide a general framework for modeling reticulate evolutionary processes such as hybridization, recombination, and horizontal gene transfer. In this paper, we study the asymptotic counting of binary phylogenetic…
This article investigates combinatorial properties of non-ambiguous trees. These objects we define may be seen either as binary trees drawn on a grid with some constraints, or as a subset of the tree-like tableaux previously defined by…
Most of major algorithms for phylogenetic tree reconstruction assume that sequences in the analyzed set either do not have any offspring, or that parent sequences can maximally mutate into just two descendants. The graph resulting from such…
Here we show that deciding whether two rooted binary phylogenetic trees on the same set of taxa permit a cherry-picking sequence, a special type of elimination order on the taxa, is NP-complete. This improves on an earlier result which…
Various real-life applications, for example, Internet of Things, wireless sensor networks, smart grids, transportation networks, communication networks, social networks, and computer grid systems, are always modeled as network structures.…
A decision tree looks like a simple directed acyclic computational graph, where only the leaf nodes specify the output values and the non-terminals specify their tests or split conditions. From the numerical perspective, we express decision…
A tree is scattered if no subdivision of the complete binary tree is a subtree. Building on results of Halin, Polat and Sabidussi, we identify four types of subtrees of a scattered tree and a function of the tree into the integers at least…
Geometry of networks endowed with a causal structure is discussed using the conventional framework of equilibrium statistical mechanics. The popular growing network models appear as particular causal models. We focus on a class of tree…
In analogy to a concept of Fibonacci trees, we define the leaf-Fibonacci tree of size $n$ and investigate its number of nonisomorphic leaf-induced subtrees. Denote by $f_0$ the one vertex tree and $f_1$ the tree that consists of a root with…
We study compact straight-line embeddings of trees. We show that perfect binary trees can be embedded optimally: a tree with $n$ nodes can be drawn on a $\sqrt n$ by $\sqrt n$ grid. We also show that testing whether a given binary tree has…
A compacted binary tree is a directed acyclic graph encoding a binary tree in which common subtrees are factored and shared, such that they are represented only once. We show that the number of compacted binary trees of size $n$ grows…
Phylogenetic networks are a generalization of evolutionary trees that are used by biologists to represent the evolution of organisms which have undergone reticulate evolution. Essentially, a phylogenetic network is a directed acyclic graph…
We define and give explicit construction of the universal tree-graded space with a given collection of pieces. We apply that to proving uniqueness of asymptotic cones of relatively hyperbolic groups whose peripheral subgroups have unique…
In this series, we introduce and investigate the concept of connectoids, which captures the connectivity structure of various discrete objects such as undirected graphs, directed graphs, bidirected graphs, hypergraphs and finitary matroids.…
The theory of Hubbard trees provides an effective classification of non-linear post-critically finite polynomial maps from \C to itself. This note will extend this classification to the case of maps from a finite union of copies of \C to…
Generalizing the classical matrix-tree theorem we provide a formula counting subgraphs of a given graph with a fixed 2-core. We use this generalization to obtain an analog of the matrix-tree theorem for the root system $D_n$ (the classical…
We develop a purely set-theoretic formalism for binary trees and binary graphs. We define a category of binary automata, and display it as a fibred category over the category of binary graphs. We also relate the notion of binary graphs to…