Search
Search Results
-
Tree Balance Indices A Comprehensive Survey
Whether you are looking for an introduction to the field of tree balance, a reference work on the multitude of available balance indices or...
-
Bounded-Diameter Tree-Decompositions
When does a graph admit a tree-decomposition in which every bag has small diameter? For finite graphs, this is a property of interest in algorithmic...
-
Planar Spiral Slit Tree
The previous chapter showed that if the slitslitgraph graph Λ of a vm-reductionvertex-merge reduction is a tree, then we can unfold P to the plane,...
-
Tree-Partitions with Bounded Degree Trees
A tree-partition of a graph G is a partition of V(G) such that identifying the vertices in each part gives a tree. It is known that every graph with...
-
NeuroPrim: An attention-based model for solving NP-hard spanning tree problems
Spanning tree problems with specialized constraints can be difficult to solve in real-world scenarios, often requiring intricate algorithmic design...
-
On Suffix Tree Detection
A suffix tree is a fundamental data structure for string processing and information retrieval, however, its structure is still not well understood....
-
Genetic Algorithm for Guide Tree Optimization
AbstractConstructing an accurate multiple structural alignment of proteins is an important step in studying their functions. Most methods of multiple...
-
Generation of Orchard and Tree-Child Networks
Phylogenetic networks are an extension of phylogenetic trees that allow for the representation of reticulate evolution events. One of the classes of...
-
Spiral Tree on Polyhedron
In previous chapters we established the planar model for our spiral treeslittreespiral tree (based on convex hulls)convex hull and the extensions to...
-
The Quadratic Minimum Spanning Tree Problem: Lower Bounds via Extended Formulations
The quadratic minimum spanning tree problem (QMSTP) is the problem of finding a spanning tree of a graph such that the total interaction cost between...
-
Bounds on tree distribution in number theory
By recursively applying the prime decomposition to the exponents, every natural number determines a rooted planar tree in a canonical way. In...
-
Recovering the Shape of an Equilateral Quantum Tree by Two Spectra
We show how to find the shape of an equilateral tree using the spectra of the Neumann and the Dirichlet problems generated by the Sturm–Liouville...
-
Tree languages and branched groups
We study the portraits of isometries of rooted trees—the labelling of the tree, at each vertex, by the permutation of its descendants—in terms of...
-
Probability Distribution of Tree Age for the Simple Birth–Death Process, with Applications to Distributions of Number of Ancestral Lineages and Divergence Times for Pairs of Taxa in a Yule Tree
In this contribution, a general expression is derived for the probability density of the time to the most recent common ancestor (TMRCA) of a simple...
-
On solving bi-objective constrained minimum spanning tree problems
This paper investigates two approaches for solving bi-objective constrained minimum spanning tree problems. The first seeks to minimize the tree...
-
Synthesis of a quantum tree Weyl matrix
A method for successive synthesis of a Weyl matrix (or Dirichlet-to-Neumann map) of an arbitrary quantum tree is proposed. It allows one, starting...
-
Tree-likeness of inverse limits with set-valued bonding functions
In this paper, we establish conditions under which the inverse limits with set-valued bonding functions are tree-like continua. We show that if we...
-
The forward and backward shift on the Hardy space of a tree
In this paper we initiate the study of the forward and backward shifts on the discrete generalized Hardy space of a tree and the discrete generalized...
-
A note on Hata’s tree-like sets
For the iterated function system (IFS in short) according to Hata’s tree-like set, the following questions are studied: (i) Under which conditions...
-
