Search
Search Results
-
The Zero Forcing Span of a Graph
In zero forcing, the focus is typically on finding the minimum cardinality of any zero forcing set in the graph; however, the number of cardinalities...
-
Geometry of tree-based tensor formats in tensor Banach spaces
In the paper ‘On the Dirac–Frenkel Variational Principle on Tensor Banach Spaces’ , we provided a geometrical description of manifolds of tensors in...
-
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...
-
How to Fit a Tree in a Box
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...
-
-
Tree Summation Formulas
It is a common feature in mathematics that recursive formulas can often be expanded into summation formulas over a certain set of combinatorial data....
-
Approximation Algorithms for Solving the 1-Line Minimum Steiner Tree of Line Segments Problem
We address the 1-line minimum Steiner tree of line segments (1L-MStT-LS) problem. Specifically, given a set S of n disjoint line segments in
... 
-
Assessing the Potential of Gene Tree Parsimony for Microbial Phylogenomics
A key challenge in microbial phylogenomics is that microbial gene families are often affected by extensive horizontal gene transfer (HGT). As a...
-
Approximation Theory of Tree Tensor Networks: Tensorized Univariate Functions
We study the approximation of univariate functions by combining tensorization of functions with tensor trains (TTs)—a commonly used type of tensor...
-
Multiscale Tree Sampling Regularization of Inverse Spherical Pseudodifferential Equations
This chapter is concerned with multiscale tree-algorithmic sampling regularization of ill-posed inverse spherical pseudodifferential equations by (a...
-
Approximation algorithms for solving the line-capacitated minimum Steiner tree problem
In this paper, we address the line-capacitated minimum Steiner tree problem (the Lc-MStT problem, for short), which is a variant of the (Euclidean)...
-
Toeplitz Operators on \({\mathcal {L}}^p\)-Spaces of a Tree
Let T be a rooted, countable infinite tree without terminal vertices. In the present paper, we investigate the spectra, self-adjointness, positivity,...
-
Biological pest control and crop–tree competition in agroforestry: a dynamical systems analysis
Agroforestry is a land-use system based on the simultaneous cultivation of crops and trees. The abundance and diversity of species living in...
-
A Systematic VANET Traffic Congestion by Eliminating Recursion Using Intervention Linear Minimum Spanning Tree (ILMST) for Traffic Management System
National concern for road safety and human involvement in transportation are becoming increasingly important in everyone’s life. As a result, traffic...
-
-
-
The Voter Basis and the Admissibility of Tree Characters
Let ≽ be a total order on the power set of a finite set [ n ]. A subset S ⊂ [ n ] is separable when for any X , Y ⊂ S and any Z ⊂ [ n ] − S , the ordering of X ...
-
Zagreb connection indices in structure property modelling
One of the major branches of mathematical chemistry is the chemical graph theory that employs graph invariants to demonstrate chemical phenomena...
-
New Reduction Rules for the Tree Bisection and Reconnection Distance
Recently it was shown that, if the subtree and chain reduction rules have been applied exhaustively to two unrooted phylogenetic trees, the reduced...
-
Data mule scheduling on a path with handling time and time span constraints
In this paper, we study a data mule scheduling problem in which data mules are dispatched from a depot to serve targets located on a path. Every...
