Results 21 to 30 of about 2,454,229 (313)
The diameter of caterpillar associahedra
CoRR, 2021 The caterpillar associahedron $\mathcal{A}(G)$ is a polytope arising from the rotation graph of search trees on a caterpillar tree $G$, generalizing the rotation graph of binary search trees (BSTs) and thus the conventional associahedron. We show that the diameter of $\mathcal{A}(G)$ is $Θ(n + m \cdot (H+1))$, where $n$ is the number of vertices, $m ...
openaire +4 more sources
Diameter-Dependent Competitive Adsorption of Sodium Dodecyl Sulfate and Single-Stranded DNA on Carbon Nanotubes [PDF]
, 2023 The equilibrium compositions of coatings on single-wall carbon nanotubes were spectroscopically deduced for samples dispersed in dilute sodium dodecyl sulfate (SDS) and then exposed to low concentrations of ssDNA oligomers.
Sergei M. Bachilo (1366209) +2 more
core +1 more source
Minimizing the oriented diameter of a planar graph [PDF]
, 2009 We consider the problem of minimizing the diameter of an orientation of a planar graph. A result of Chvátal and Thomassen shows that for general graphs, it is NP-complete to decide whether a graph can be oriented so that its diameter is at most two.
Noble, SD +3 more
core +1 more source
Algorithms, 2015 Aggregation delay is the minimum number of time slots required to aggregate data along the edges of a data gathering tree (DG tree) spanning all the nodes in a wireless sensor network (WSN).
Natarajan Meghanathan
doaj +1 more source
On the Circuit Diameter Conjecture [PDF]
Discrete & Computational Geometry, 2018 From the point of view of optimization, a critical issue is relating the combinatorial diameter of a polyhedron to its number of facets $f$ and dimension $d$. In the seminal paper of Klee and Walkup [KW67], the Hirsch conjecture of an upper bound of $f-d$ was shown to be equivalent to several seemingly simpler statements, and was disproved for ...
Steffen Borgwardt +2 more
openaire +2 more sources
Parameterized Complexity of Diameter [PDF]
Algorithmica, 2019 AbstractDiameter—the task of computing the length of a longest shortest path—is a fundamental graph problem. Assuming the Strong Exponential Time Hypothesis, there is no $$O(n^{1.99})$$ O ( n 1.99
Bentert, Matthias, Nichterlein , André
openaire +4 more sources
Volume quantity and percentage of Beech industrial, fuel and stump timber portions at Caspian Forests of Iran [PDF]
تحقیقات جنگل و صنوبر ایران, 2005 The aim of the study was to investigate the volume and amount of the Beech (Fagus orientalis) industrial, Fuel and stump timber portions at west forests of Gilan province in Caspian Region of Iran.
Farrokh Poorshakoori Allahdeh +1 more
doaj
Stem taper models for maritime pine plantations in Istanbul Sarıyer Region
Turkish Journal of Forestry, 2020 Maritime pine (Pinus pinaster Ait.) is one of the most important tree species in Turkey for establish industrial plantations. In this study, stem taper models were developed for maritime pine plantations in İstanbul-Sarıyer region.
Utkun Karakuyu, Ramazan Ozçeli̇k
doaj +1 more source
On the Diameter of Tree Associahedra [PDF]
The Electronic Journal of Combinatorics, 2018 We consider a natural notion of search trees on graphs, which we show is ubiquitous in various areas of discrete mathematics and computer science. Search trees on graphs can be modified by local operations called rotations, which generalize rotations in binary search trees. The rotation graph of search trees on a graph $G$ is the skeleton of a polytope
Jean Cardinal +2 more
openaire +4 more sources
Comparison of height, diameter and wood production of 14 Poplar clones in Esfahan province [PDF]
تحقیقات جنگل و صنوبر ایران, 2008 Poplar trees are the fastest growing trees in the northern hemisphere and it woods is suitable for a variety uses and they are the most important resource of wood production. For this reason they are best plant for wood culture.
Haydar Ali Daneshvar +1 more
doaj